On the security loss of unique signatures
type: Item
instance of: scholarly article
title: On the security loss of unique signatures
zbMATH Open document ID: 1443.94099
DOI: 10.1007/978-3-030-03807-6_19
author: Andrew Morgan
author: Rafael Pass
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 6992103
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 19
OpenAlex ID: W2889529480
cites work: Tightly-Secure Signatures from Lossy Identification Schemes
cites work: Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
cites work: On the Impossibility of Tight Cryptographic Reductions
cites work: Notions of Black-Box Reductions, Revisited
cites work: The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
cites work: On the Hardness of Proving CCA-Security of Signed ElGamal
cites work: Proving Tight Security for Rabin-Williams Signatures
cites work: Breaking RSA may not be equivalent to factoring
cites work: Weak Verifiable Random Functions
cites work: Separation Results on the “One-More” Computational Problems
cites work: Adaptive hardness and composable security in the plain model from standard assumptions
cites work: Tightly Secure IBE Under Constant-Size Master Public Key
cites work: Fully, (Almost) Tightly Secure IBE and Dual System Groups
cites work: Q4737250
cites work: Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
cites work: New directions in cryptography
cites work: Q4542559
cites work: On the Impossibility of Three-Move Blind Signature Schemes
cites work: The knowledge complexity of interactive proof-systems
cites work: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
cites work: On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
cites work: Tightly Secure Signatures and Public-Key Encryption
cites work: Waters Signatures with Optimal Security Reduction
cites work: Q5750403
cites work: Verifiable Random Functions from Weaker Assumptions
cites work: Optimal Security Proofs for Full Domain Hash, Revisited
cites work: Bounded-concurrent secure two-party computation without setup assumptions
cites work: Q4871218
cites work: Q4409145
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Limits of provable security from standard assumptions
cites work: The sleepy model of consensus
cites work: Concurrent zero knowledge, revisited
cites work: On Constant-Round Concurrent Zero-Knowledge
cites work: Q4250778
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Memory lower bounds of reductions revisited
description: scientific article; zbMATH DE number 6992103