Improved Non-committing Encryption Schemes Based on a General Complexity Assumption
- 11 August 2000
- book chapter
- Published by Springer Nature
- p. 432-450
- https://doi.org/10.1007/3-540-44598-6_27
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Security preserving amplification of hardnessPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Secure ComputationPublished by Springer Nature ,2001
- Foundations of Secure Interactive ComputingPublished by Springer Nature ,2001
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Nature ,2000
- Adaptively Secure Threshold Cryptography: Introducing Concurrency, Removing ErasuresPublished by Springer Nature ,2000
- Plug and play encryptionPublished by Springer Nature ,1997
- Adaptively secure multi-party computationPublished by Association for Computing Machinery (ACM) ,1996
- Zero-knowledge proofs of knowledge without interactionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Analysis of a simple factorization algorithmTheoretical Computer Science, 1976