Loading...
Please wait, while we are loading the content...
Similar Documents
Magic functions (2000).
| Content Provider | CiteSeerX |
|---|---|
| Author | Dwork, Cynthia Naor, Moni Reingold, Omer Stockmeyer, Larry |
| Abstract | We prove that three apparently unrelated fundamental problems in distributed computing, cryptography, and complexity theory, are essentially the same problem. These three problems and brief descriptions of them follow. (1) The selective decommitment problem. An adversary is given commitments to a collection of messages, and the adversary can ask for some subset of the commitments to be opened. The question is whether seeing the decommitments to these open plaintexts allows the adversary to learn something unexpected about the plaintexts that are still hidden. (2) The power of 3-round weak zero-knowledge arguments. The question is what can be proved in (a possibly weakened form of) zero-knowledge in a 3-round argument. In particular, is there a language outside of BPP that has a 3-round public-coin weak zeroknowledge argument? (3) The Fiat-Shamir methodology. This is a method for converting a 3round public-coin argument (viewed as an identification scheme) to a 1-round signatu... |
| File Format | |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Magic Function Fiat-shamir Methodology Distributed Computing Identification Scheme Brief Description Complexity Theory Selective Decommitment Problem 3-round Weak Zero-knowledge Argument 3-round Public-coin Weak Zeroknowledge Argument Public-coin Argument Open Plaintexts 1-round Signatu Unrelated Fundamental Problem 3-round Argument |
| Content Type | Text |
