Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption

The authors consider a class of two-party function evaluation protocols in which the parties are allowed to use ideal functionalities as well as a set of powerful primitives, namely commitments, homomorphic encryption, and certain zero-knowledge proofs. They illustrate that with these it is possible to capture protocols for oblivious transfer, coin-flipping, and generation of multiplication-triple. They show how any protocol in their class can be compiled to a symbolic representation expressed as a process in an abstract process calculus, and prove a general computational soundness theorem implying that if the protocol realizes a given ideal functionality in the symbolic setting, then the original version also realizes the ideal functionality in the standard computational UC setting.

Provided by: Aarhus University Topic: Security Date Added: May 2013 Format: PDF

Find By Topic