Secure two-party context free language recognition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3816 LNCS, Issue , 2005, Pages 117-124

  Singh, Anshuman ^a   Barman, Siddharth ^a   Shukla, K K ^a  

^a BANARAS HINDU UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; FORMAL LANGUAGES; NETWORK PROTOCOLS; PATTERN RECOGNITION; SECURITY OF DATA;

COMPUTATION PROTOCOLS; COOPERATIVE COMPUTATION; LANGUAGE RECOGNITION; MULTIPARTY COMPUTATIONS;

COMPUTER NETWORKS;

EID: 33744930363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604655_15     Document Type: Conference Paper

References (12)

1. A. Yao. Protocols for secure computations: In Proceedings of the twenty-third annual IEEE Symposium on Foundations of Computer Science, pages 160-164. IEEE Computer Society, 1982.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson: Completeness theorems for non-cryptographic fault- tolerant distributed computation. In Proc. of 20th STOC, pp. 1-10, 1988.
3. A. Yao: How to generate and exchange secrets. In Proceedings of the twenty-seventh annual IEEE Symposium on Foundations of Computer Science, pages 162-167. IEEE Computer Society, 1986
4. nd Ed., John Wiley & Sons Pte Ltd, pp. 96, pp. 543
5. David Chaum, Claude Cropeau, and Ivan Damgard: Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 11-19. ACM Press, 1988.
6. D. Beaver, S. Micali, and P. Rogaway: The round complexity of secure protocols. In Proc. of 22nd STOC, pp. 503-513, 1990.
7. M. Franklin and M. Yung. Communication complexity of secure computation. In Proc. of 24th STOC, pp. 699-710, 1992.
8. O. Goldreich, S. Micali, and A. Wigderson: How to play any mental game (extended abstract). In Proc. of 19th STOC, pp. 218-229, 1987.
9. R.Canetti, U.Fiege, O.Goldreich and M.Naor: Adaptively Secure Computation, Proceedings of STOC 1996.
10. J.Kilian: Founding Cryptography on Oblivious Transfer, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 2031, Chicago, Illinois, 24 May 1988.
11. Peter Linz: An Introduction to Formal Languages and Automata, Narosa Publications.
12. O. Goldreich: Secure Multiparty Computation, Version 1.4, available at http://www.wisdom.weizmann.ac.il/-oded/PS/prot.ps