Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
- 11 August 2000
- book chapter
- Published by Springer Nature
- p. 432-450
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Security preserving amplification of hardness2002
- Secure Computation2001
- Foundations of Secure Interactive Computing2001
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information2000
- Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing Erasures2000
- Plug and play encryption1997
- Adaptively secure multi-party computation1996
- Zero-knowledge proofs of knowledge without interaction1992
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Analysis of a simple factorization algorithmTheoretical Computer Science, 1976