How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A randomized protocol for signing contracts
Communications of the ACM
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The bit security of modular squaring given partial factorization of the modulos
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
A private interactive test of a boolean predicate a minimum-knowledge public-key cryptosystems
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th 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
Flipping Coins In Many Pockets (Byzantine Agreement On Uniformly Random Values)
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
How To Construct Randolli Functions
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Demonstrating possession of a discrete logarithm without revealing it
Proceedings on Advances in cryptology---CRYPTO '86
Subliminal-free authentication and signature
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
CRYPTO '88 Proceedings on Advances in cryptology
Abuses in cryptography and how to fight them
CRYPTO '88 Proceedings on Advances in cryptology
A New \mathcal{NP}-Complete Problem and Public-Key Identification
Designs, Codes and Cryptography
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Strong Solutions to the Identification Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Auditable, Anonymous Electronic Cash Extended Abstract
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Gradual and Verifiable Release of a Secret
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Multi-Language Zero Knowledge Interactive Proof Systems
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Informatics - 10 Years Back. 10 Years Ahead.
Extended methodology of RS design and instances based on GIP
Journal of Computer Science and Technology
Zero-knowledge from secure multiparty computation
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lossy trapdoor functions and their applications
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Cryptography with constant computational overhead
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
A note on universal composable zero-knowledge in the common reference string model
Theoretical Computer Science
A note on the feasibility of generalised universal composability†
Mathematical Structures in Computer Science
Distributed Public-Key Cryptography from Weak Secrets
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Exploiting cryptography for privacy-enhanced access control: A result of the PRIME Project
Journal of Computer Security - EU-Funded ICT Research on Trust and Security
An improved protocol for demonstrating possession of discrete logarithms and some generalizations
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A note on universal composable zero knowledge in common reference string model
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A note on the feasibility of generalized universal composability
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A global authentication scheme for mobile ad-hoc networks
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Conditionally verifiable signature
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Secure set membership using 3SAT
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Algorithm for proving the knowledge of an independent vertex set
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Generic constructions for verifiable signcryption
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
ZQL: a compiler for privacy-preserving data processing
SEC'13 Proceedings of the 22nd USENIX conference on Security
An efficient privacy-preserving solution for finding the nearest doctor
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
Under the assumption that encryption functions exist, we show that all languages in NP possess zero-knowledge proofs.That is, it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula. In particular, without yielding neither a satisfying assignment nor weaker properties such as whether there is a satisfying assignment in which x1=TRUE, or whether there is a satisfying assignment in which x1=x3 etc.The above result allows us to prove two fundamental theorems in the field of (two-party and multi-party) cryptographic protocols. These theorems yield automatic and efficient transformations that, given a protocol that is correct with respect to an extremely weak adversary, output a protocol correct in the most adversarial scenario. Thus, these theorems imply powerful methodologies for developing two-party and multiparty cryptographic protocols.