The following pages link to Certifying RSA (Q4911598):
Displaying 7 items.
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations (Q1629427) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms (Q2167716) (← links)
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents (Q2170085) (← 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)
