Pages that link to "Item:Q1629429"

The following pages link to Certifying trapdoor permutations, revisited (Q1629429):

Displaying 20 items.

• Trapdoor hard-to-invert group isomorphisms and their application to password-based authentication (Q882777) (← links)
• Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
• Certifying trapdoor permutations, revisited (Q1629429) (← links)
• Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation (Q1924194) (← links)
• Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
• Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
• Certifying algorithms and relevant properties of reversible primitive permutations with \textsf{Lean} (Q2097420) (← links)
• A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
• Enhancements of trapdoor permutations (Q2392094) (← links)
• Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
• Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
• How to sign given any trapdoor permutation (Q4302825) (← links)
• On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations (Q5746341) (← links)
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
• Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
• NIZK from SNARGs (Q6110372) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
• Non-interactive zero-knowledge from LPN and MQ (Q6653050) (← links)