Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art

DOI10.1007/978-3-642-22670-0_28zbMath1343.94053OpenAlexW93436670MaRDI QIDQ3088194

Oded Goldreich

Publication date: 19 August 2011

Published in: Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0_28

zbMATH Keywords

non-interactive zero-knowledgetrapdoor permutations

Mathematics Subject Classification ID

Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (10)

Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Certifying trapdoor permutations, revisited ⋮ Enhancements of trapdoor permutations ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Explainable arguments ⋮ NIZK from SNARGs ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Chosen ciphertext security from injective trapdoor functions

Cites Work

• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Foundations of Cryptography
• Foundations of Cryptography
• Computational Complexity
• Theory of Cryptography
• Unnamed Item

This page was built for publication: Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art