A randomized protocol for signing contracts
Communications of the ACM
The complexity of perfect zero-knowledge
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Demonstrating that a public predicate can be satisfied without revealing any information about how
Proceedings on Advances in cryptology---CRYPTO '86
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
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
Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Oblivious transfer protecting secrecy
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Non-interactive oblivious transfer and applications
CRYPTO '89 Proceedings on Advances in cryptology
Multiparty protocols tolerating half faulty processors
CRYPTO '89 Proceedings on Advances in cryptology
Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Non-Interactive Zero-Knowledge Proof Systems
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Equivalence Between Two Flavours of Oblivious Transfers
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Non-Interactive Zero-Knowledge with Preprocessing
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
A logic to reason about likelihood
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Minimum resource zero knowledge proofs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Multiple non-interactive zero knowledge proofs based on a single random string
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Oblivious transfer protecting secrecy
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Crptograpic Applications of the Non-Interactive Metaproof and Many-Prover Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Non-interactive circuit based proofs and non-interactive perfect zero-knowledge with preprocessing
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Conditional oblivious transfer and timed-release encryption
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Alternative protocols for generalized oblivious transfer
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
| Hi-index | 0.00 |
In this work we investigate the power of Public Randomness in the context of Public-key cryptosystems. We consider the Diffie-Hellman Public-key model in which an additional short random string is shared by all users. This, which we call Public-Key Public-Randomness (PKPR) model, is very powerful as we show that it supports simple non-interactive implementations of important cryptographic primitives.We give the first completely non-interactive implementation of Oblivious Transfer. Our implementation is also secure against receivers with unlimited computational power.We propose the first implementation of non-interactive nature for Perfect Zero-Knowledge in the dual model of Brassard, Cr茅peau, and Chaum for all NP-languages.