Papers
總共有 9 篇 papers
- PRIMES is in P
- The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-Rewinding Proofs for Schnorr Identification and Signatures
- Tighter Security for Schnorr Identification and Signature: A High-Moment Forking Lemma for Sigma-Protocols
- The One-More Discrete Logarithm Assumption in the Generic Group Model
- GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
- Lower Bounds for Discrete Logarithms and Related Problems
- The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
- Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols via Hitting Games
- Tight Bounds on Uniform-Challenge Reductions from Sigma Protocols via Hitting Games - Introduction