Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
- 13 September 2002
- book chapter
- Published by Springer Nature
- p. 581-596
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Universally Composable Commitments2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols2001
- Universally composable security: a new paradigm for cryptographic protocols2001
- Efficient Concurrent Zero-Knowledge in the Auxiliary String Model2000
- A new public-key cryptosystem as secure as factoring1998
- Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?Lecture Notes in Computer Science, 1998
- Minimum resource zero knowledge proofs1989