Pages that link to "Item:Q1924194"

The following pages link to Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation (Q1924194):

Displaying 25 items.

• Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
• Certifying trapdoor permutations, revisited (Q1629429) (← links)
• Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
• An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity (Q1983326) (← links)
• Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
• Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
• Mercurial commitments with applications to zero-knowledge sets (Q2377062) (← links)
• Enhancements of trapdoor permutations (Q2392094) (← links)
• Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
• Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
• Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
• Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art (Q3088194) (← links)
• (Q3374903) (← links)
• A Brief History of Provably-Secure Public-Key Encryption (Q3506393) (← links)
• Zero-Knowledge Proofs of Proximity (Q4993282) (← links)
• An Exponential Separation Between MA and AM Proofs of Proximity (Q5002752) (← links)
• Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
• Efficient Sequential Aggregate Signed Data (Q5458585) (← links)
• On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations (Q5746341) (← links)
• Verifiable random functions from non-interactive witness-indistinguishable proofs (Q5918799) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
• Unbiasable verifiable random functions (Q6637523) (← links)
• Non-interactive zero-knowledge from LPN and MQ (Q6653050) (← links)