The following pages link to (Q4318714):
Displaying 11 items.
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Oblivious transfer from trapdoor permutations in minimal rounds (Q2697874) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Non-interactive zero-knowledge from LPN and MQ (Q6653050) (← links)
