How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Demonstrating that a public predicate can be satisfied without revealing any information about how
Proceedings on Advances in cryptology---CRYPTO '86
Zero-knowledge simulation of Boolean circuits
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
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
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
On hiding information form an oracle
Journal of Computer and System Sciences
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A discrete logarithm implementation of perfect zero-knowledge blobs
Journal of Cryptology
Pseudo-random generators under uniform assumptions
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Perfect zero-knowledge in constant rounds
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Fast generation of secure RSA-moduli with almost maximal diversity
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Primality and Cryptography
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
Direct Minimum-Knowledge Computations
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
Bit Commitment Using Pseudo-Randomness
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Zero Knowledge Proofs of Knowledge in Two Rounds
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Quantum Bit Commitment and Coin Tossing Protocols
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
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
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
One-way functions are essential for complexity based cryptography
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Efficient cryptographic schemes provably as secure as subset sum
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
How convincing is your protocol?
ACM SIGACT News
Fair exchange with a semi-trusted third party (extended abstract)
Proceedings of the 4th ACM conference on Computer and communications security
Proceedings of the 4th ACM conference on Computer and communications security
Constructions and Bounds for Unconditionally Secure Non-Interactive Commitment Schemes
Designs, Codes and Cryptography
How to Time-Stamp a Digital Document
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Practical Quantum Oblivious Transfer
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New Constructions for Secure Hash Functions
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
| Hi-index | 0.00 |
Bit commitment schemes are central to all zero-knowledge protocols [GMR89] for NP-complete problems [GMW86, BC86a, BC86b, BCC88, BCY89, FS89, etc.]. One-way group actions is a natural and powerful primitive for the implementation of bit commitment schemes. It is a generalization of the one-way group homomorphism [IY88], which was not powerful enough to capture the bit commitment scheme based on graph isomorphism [BC86b]. It provides a unified theory for all the known bit commitment schemes that offer unconditional protection for the originator of the commitments, and for many of those that offer her statistical protection. (Unconditional protection means that the value of the bit committed to is always perfectly concealed. Statistical protection either means that this is almost always the case, or that only an arbitrarily small probabilistic bias about this bit can leak; in either cases, statistical protection must hold even against unlimited computing power.)Bit commitment schemes based on one-way group actions automatically have the chameleon property [BCC88] (also called trap-door [FS89]), which is useful for the parallelization of zero-knowledge protocols [BCY89, FS89]. Moreover, these bit commitment schemes allow the originator of two commitments to convince the receiver that they are commitments to the same bit, provided that this is so, without disclosing any information about which bit this is.In addition, one-way group actions are also a natural primitive for the implementation of claw-free pairs of functions [GMRi88].