Security arguments for digital signatures and blind signatures
From MaRDI portal
Publication:1573771
This paper proves the security of a large class of signature schemes in the so-called random oracle model. This model assumes that the hash function used in a signature scheme behaves as a random function. However, it has been shown that there exist (contrived) schemes that are provably secure in the random oracle model, but not when used with a real hash function. So, as also stated by the authors of the paper: the paper offers security arguments for a large class of known signature schemes that includes for instance the Schnorr signature scheme and a slight variation of the well-known ElGamal signature scheme. The latter is particuarly interesting as, in spite of the existential forgery of the original scheme, the paper proves that the proposed variant resists existential forgeries even against an adaptively chosen-message attack, assuming the discrete logarithm problem is hard to solve. The paper furthermore studies the security of blind signatures. Such schemes are an important ingredient for anonymity in electronic cash systems. The paper also proposes new blind signature schemes and gives a security argument for it.
Recommendations
Cited in
(only showing first 100 items - show all)- Algorithms of information authentication for the automatic control systems on the basis of structures in finite vector spaces
- Obtaining a secure and efficient key agreement protocol from (H)MQV and NAXOS
- Security proofs for identity-based identification and signature schemes
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Improving the exact security of digital signature schemes
- Identity-based undetachable digital signature for mobile agents in electronic commerce
- Fiat-Shamir for highly sound protocols is instantiable
- Provably secure and pairing-based strong designated verifier signature scheme with message recovery
- Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system
- The wonderful world of global random oracles
- On the tightness of forward-secure signature reductions
- Privacy-preserving certificateless provable data possession scheme for big data storage on cloud
- A novel authenticated encryption scheme and its extension
- Zero-knowledge argument for simultaneous discrete logarithms
- Policy controlled system with anonymity
- Public key signatures in the multi-user setting.
- Provably secure proxy signature scheme from factorization
- Improved convertible authenticated encryption scheme with provable security
- A high capacity quantum weak blind signature based on logistic chaotic maps
- Compact designated verifier NIZKs from the CDH assumption without pairings
- An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
- Security of hedged Fiat-Shamir signatures under fault attacks
- Signatures from sequential-OR proofs
- Boosting verifiable computation on encrypted data
- Efficient range proofs with transparent setup from bounded integer commitments
- An efficient blind signature scheme based on SM2 signature algorithm
- Anonymous tokens with private metadata bit
- Lattice-based blind signatures, revisited
- New code-based cryptographic accumulator and fully dynamic group signature
- A QDS scheme based on superdense teleportation
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- Practical algorithm substitution attack on extractable signatures
- Two-round trip Schnorr multi-signatures via delinearized witnesses
- MuSig2: simple two-round Schnorr multi-signatures
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- A novel version of the hidden logarithm problem for post-quantum signature algorithms
- Privacy-preserving file sharing on cloud storage with certificateless signcryption
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Robust subgroup multi-signatures for consensus
- A correction to a code-based blind signature scheme
- Reusing nonces in Schnorr signatures (and keeping it secure...)
- Efficient proof composition for verifiable computation
- Improved signature schemes for secure multi-party computation with certified inputs
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Short pairing-free blind signatures with exponential security
- An efficient certificateless aggregate signature without pairings for vehicular ad hoc networks
- Cryptanalysis of a code-based one-time signature
- An efficient eCK secure identity based two party authenticated key agreement scheme with security against active adversaries
- Strongly secure identity-based authenticated key agreement protocols without bilinear pairings
- Identity-based signatures in standard model
- Simple Schnorr multi-signatures with applications to bitcoin
- Lattice-based revocable certificateless signature
- A pairing-based three-party authenticated encryption scheme without shared secrets
- Practical (fully) distributed signatures provably secure in the standard model
- Identity-based signature scheme based on quadratic residues
- An efficient multi-receipt mechanism for uncoercible anonymous electronic voting
- Security of blind signatures revisited
- Attribute-based signatures from RSA
- Signcryption schemes with threshold unsigncryption, and applications
- An efficient certificateless proxy signature scheme without pairing
- A provably secure short signature scheme based on discrete logarithms
- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
- Identity-based ring signatures from RSA
- Enhancing the security of perfect blind DL-signatures
- Security of the design of time-stamped signatures
- Cryptanalysis and improvement of a certificateless signcryption scheme without bilinear pairing
- A new key authentication scheme for cryptosystems based on discrete logarithms
- Identity based designated multi-confirmer signature: a new type signature
- Generic groups, collision resistance, and ECDSA
- Combined schemes for signature and encryption: the public-key and the identity-based setting
- Attribute-based versions of Schnorr and ElGamal
- Simulation-sound arguments for LWE and applications to KDM-CCA2 security
- Practical dynamic group signatures without knowledge extractors
- Acyclicity programming for sigma-protocols
- Linearly homomorphic signatures with designated combiner
- Code-based signatures from new proofs of knowledge for the syndrome decoding problem
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature
- The electronic cash system based on non-interactive zero-knowledge proofs
- Fiat-Shamir for highly sound protocols is instantiable
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Optimal security proofs for signatures from identification schemes
- Two-message, oblivious evaluation of cryptographic functionalities
- Strong forward security in identity-based signcryption
- On the Rabin Signature
- Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography
- Security proofs for signature schemes
- Another look at tightness
- On the joint security of encryption and signature in EMV
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound
- Structure-preserving signatures and commitments to group elements
- Simple-yet-efficient construction and revocation of group signatures
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- A NOVEL IDENTITY-BASED KEY-INSULATED CONVERTIBLE AUTHENTICATED ENCRYPTION SCHEME
- A signature scheme with efficient proof of validity
- Designing efficient authenticated key exchange resilient to leakage of ephemeral secret keys
- TMQV: A Strongly eCK-Secure Diffie-Hellman Protocol without Gap Assumption
- Security of blind signatures under aborts and applications to adaptive oblivious transfer
- Tightly secure signatures from lossy identification schemes
- Adaptively secure strong designated signature
This page was built for publication: Security arguments for digital signatures and blind signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1573771)
