Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model)
From MaRDI portal
Publication:6487208
DOI10.1007/978-3-319-61204-1_17zbMath1521.94029MaRDI QIDQ6487208
Bogdan Warinschi, Ngoc Khanh Nguyen, David Bernhard
Publication date: 1 July 2022
Related Items (1)
Cites Work
- Unnamed Item
- Efficient signature generation by smart cards
- Complexity of a determinate algorithm for the discrete logarithm
- On the Hardness of Proving CCA-Security of Signed ElGamal
- Adaptive Proofs of Knowledge in the Random Oracle Model
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Another look at non-standard discrete log and Diffie-Hellman problems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Securing threshold cryptosystems against chosen ciphertext attack
- A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption
- Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Separation Results on the “One-More” Computational Problems
- Cryptography and Coding
This page was built for publication: Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model)
