Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
- 13 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 581-596
- https://doi.org/10.1007/3-540-45708-9_37
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Universally Composable CommitmentsLecture Notes in Computer Science, 2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Nature ,2001
- Universally composable security: a new paradigm for cryptographic protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Efficient Concurrent Zero-Knowledge in the Auxiliary String ModelLecture Notes in Computer Science, 2000
- A new public-key cryptosystem as secure as factoringLecture Notes in Computer Science, 1998
- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?Lecture Notes in Computer Science, 1998
- Minimum resource zero knowledge proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989