On the security loss of unique signatures
From MaRDI portal
Publication:1629431
DOI10.1007/978-3-030-03807-6_19zbMath1443.94099OpenAlexW2889529480MaRDI QIDQ1629431
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_19
Related Items
Optimal tightness for chain-based unique signatures ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ On the adaptive security of MACs and PRFs ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Verifiable random functions with optimal tightness ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
Cites Work
- Memory lower bounds of reductions revisited
- The sleepy model of consensus
- Concurrent zero knowledge, revisited
- On the Hardness of Proving CCA-Security of Signed ElGamal
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- Notions of Black-Box Reductions, Revisited
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Optimal Security Proofs for Full Domain Hash, Revisited
- Tightly-Secure Signatures from Lossy Identification Schemes
- Waters Signatures with Optimal Security Reduction
- Tightly Secure Signatures and Public-Key Encryption
- Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
- On the Impossibility of Three-Move Blind Signature Schemes
- Bounded-concurrent secure two-party computation without setup assumptions
- On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
- Weak Verifiable Random Functions
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Breaking RSA may not be equivalent to factoring
- The knowledge complexity of interactive proof-systems
- Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
- Verifiable Random Functions from Weaker Assumptions
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- On Constant-Round Concurrent Zero-Knowledge
- Proving Tight Security for Rabin-Williams Signatures
- Separation Results on the “One-More” Computational Problems
- Tightly Secure IBE Under Constant-Size Master Public Key
- On the Impossibility of Tight Cryptographic Reductions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the security loss of unique signatures
