Enhancements of Trapdoor Permutations
Open Access
- 13 September 2012
- journal article
- Published by Springer Science and Business Media LLC in Journal of Cryptology
- Vol. 26 (3), 484-512
- https://doi.org/10.1007/s00145-012-9131-8
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The relationship between public key encryption and oblivious transferPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial InformationPublished by Springer Science and Business Media LLC ,2000
- Multiple NonInteractive Zero Knowledge Proofs Under General AssumptionsSIAM Journal on Computing, 1999
- Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor PermutationJournal of Cryptology, 1996
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- New directions in cryptographyIEEE Transactions on Information Theory, 1976