Secure two-party context free language recognition

Authors:
Anshuman Singh;Siddharth Barman;K. K. Shukla
Affiliations:
Dept. of Computer Sc. and Engg., Institute of Technology, Banaras Hindu University, Varanasi, India;Dept. of Computer Sc. and Engg., Institute of Technology, Banaras Hindu University, Varanasi, India;Dept. of Computer Sc. and Engg., Institute of Technology, Banaras Hindu University, Varanasi, India
Venue:
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
Year:
2005

Citing 10
Cited 1

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The round complexity of secure protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An introduction to formal languages and automata

An introduction to formal languages and automata
Communication complexity of secure computation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science

Minimum disclosure routing for network virtualization and its experimental evaluation

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The growth of the internet provides opportunities for cooperative computation, it also requires development of protocols that can accomplish this task among mutually untrusting parties. The aim is to develop methods which ensure both the correct evaluation of the function and privacy of individual inputs. Multiparty Computation protocols help to achieve the aim without using a trusted third party. In this paper we consider the problem of context-free language recognition in a two-party setting. Alice has the description of a context-free language L while Bob has a secret string whose membership in L is to be checked. Neither Alice nor Bob is ready to disclose his/her input to the other. Here we propose a protocol which accomplishes secure two party context-free language recognition. The novelty of this paper lies in the use of formal languages based approach for multiparty computations.