How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
RSA and Rabin functions: certain parts are as hard as the whole
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
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
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
SIAM Journal on Computing
Journal of the ACM (JACM)
Interactive hashing can simplify zero-knowledge protocol design without computational assumptions
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Everything Provable is Provable in Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Bit Commitment Using Pseudo-Randomness
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free?
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Defining Proofs of Knowledge
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
A Complete Promise Problem for Statistical Zero-Knowledge
FOCS '97 Proceedings of the 38th 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
Achieving oblivious transfer using weakened security assumptions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
On monotone formula closure of SZK
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Efficient cryptographic protocols based on noisy channels
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Statistical secrecy and multibit commitments
IEEE Transactions on Information Theory
IWDW '07 Proceedings of the 6th International Workshop on Digital Watermarking
Non-interactive watermark detection for a correlation-based watermarking scheme
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
A secure e-tender submission protocol
TrustBus'06 Proceedings of the Third international conference on Trust, Privacy, and Security in Digital Business
Watermarking security: a survey
Transactions on Data Hiding and Multimedia Security I
Efficient implementation of zero-knowledge proofs for watermark detection in multimedia data
Transactions on Data Hiding and Multimedia Security I
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.01 |
This article is an introduction to two fundamental primitives in cryptographic protocol theory: commitment schemes and zero-knowledge protocols, and a survey of some new and old results on their existence and the connection between them.