Security arguments for digital signatures and blind signatures
From MaRDI portal
Publication:1573771
DOI10.1007/S001450010003zbMath1025.94015DBLPjournals/joc/PointchevalS00OpenAlexW2169194339WikidataQ56921502 ScholiaQ56921502MaRDI QIDQ1573771
David Pointcheval, Jacques Stern
Publication date: 8 August 2000
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001450010003
Related Items (only showing first 100 items - show all)
Another Look at Tightness ⋮ Group Signatures with Decentralized Tracing ⋮ On the Joint Security of Encryption and Signature in EMV ⋮ Security properties of one “short” signature scheme ⋮ A new ID-based proxy multi-signature scheme from bilinear pairings ⋮ Attribute-based versions of Schnorr and ElGamal ⋮ Adaptively Secure Strong Designated Signature ⋮ Practical Round-Optimal Blind Signatures in the Standard Model ⋮ Efficient ID-Based Key-Insulated Signature Scheme with Batch Verifications using Bilinear Pairings over Elliptic Curves ⋮ Certificateless Proxy Re-Encryption Without Pairings ⋮ Linkable Message Tagging: Solving the Key Distribution Problem of Signature Schemes ⋮ Private Certificate-Based Remote Data Integrity Checking in Public Clouds ⋮ Simple-Yet-Efficient Construction and Revocation of Group Signatures ⋮ Boosting the Security of Blind Signature Schemes ⋮ Chain Reductions for Multi-signatures and the HBMS Scheme ⋮ On the (im)possibility of secure ElGamal blind signatures ⋮ Multi-user CDH problems and the concrete security of \(\mathsf{NAXOS}\) and \(\mathsf{X3DH}\) ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ Security analysis of RSA-BSSA ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ The return of the SDitH ⋮ Non-interactive blind signatures for random messages ⋮ Rai-Choo! Evolving blind signatures to the next level ⋮ Two Notes on the Security of Certificateless Signatures ⋮ Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use ⋮ A random oracle for all of us ⋮ A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling ⋮ SETLA: Signature and Encryption from Lattices ⋮ Designated-verifier linkable ring signatures with unconditional anonymity ⋮ PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more ⋮ On pairing-free blind signature schemes in the algebraic group model ⋮ Simulation-sound arguments for LWE and applications to KDM-CCA2 security ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Accountable CP-ABE with Public Verifiability: How to Effectively Protect the Outsourced Data in Cloud ⋮ 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 ⋮ 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 ⋮ A NOVEL IDENTITY-BASED KEY-INSULATED CONVERTIBLE AUTHENTICATED ENCRYPTION SCHEME ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Identity-based ring signatures from RSA ⋮ A pairing-free certificateless digital multisignature scheme using elliptic curve cryptography ⋮ Removing the Strong RSA Assumption from Arguments over the Integers ⋮ A New Dynamic Code-Based Group Signature Scheme ⋮ Enhancing the security of perfect blind DL-signatures ⋮ An Anonymous Designated Verifier Signature Scheme with Revocation: How to Protect a Company’s Reputation ⋮ Fully Secure Threshold Unsigncryption ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Security of the design of time-stamped signatures ⋮ Improved Bounds on Security Reductions for Discrete Log Based Signatures ⋮ ECDSA-Verifiable Signcryption Scheme with Signature Verification on the Signcrypted Message ⋮ An Efficient ID-Based Proxy Signature Scheme from Pairings ⋮ Unlinkable Randomizable Signature and Its Application in Group Signature ⋮ One-Round ID-Based Blind Signature Scheme without ROS Assumption ⋮ Another look at HMQV ⋮ Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures ⋮ Security of Digital Signature Schemes in Weakened Random Oracle Models ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ Verifier-Key-Flexible Universal Designated-Verifier Signatures ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Extended security arguments for signature schemes ⋮ Cryptanalysis and improvement of a certificateless signcryption scheme without bilinear pairing ⋮ The electronic cash system based on non-interactive zero-knowledge proofs ⋮ A Generic Construction for Universally-Convertible Undeniable Signatures ⋮ Efficient ID-Based Digital Signatures with Message Recovery ⋮ Strongly Secure Certificateless Public Key Encryption Without Pairing ⋮ Designing Efficient Authenticated Key Exchange Resilient to Leakage of Ephemeral Secret Keys ⋮ Separation Results on the “One-More” Computational Problems ⋮ On the (in)security of ROS ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ On the (in)security of ROS ⋮ On the Portability of Generalized Schnorr Proofs ⋮ Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment ⋮ Hash function requirements for Schnorr signatures ⋮ Minicrypt primitives with algebraic structure and applications ⋮ A Schnorr-Like Lightweight Identity-Based Signature Scheme ⋮ Anonymity from Public Key Encryption to Undeniable Signatures ⋮ TMQV: A Strongly eCK-Secure Diffie-Hellman Protocol without Gap Assumption ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions ⋮ Security of blind signatures under aborts and applications to adaptive oblivious transfer ⋮ 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 ⋮ Comparing SessionStateReveal and EphemeralKeyReveal for Diffie-Hellman Protocols ⋮ Efficient Dynamic Broadcast Encryption and Its Extension to Authenticated Dynamic Broadcast Encryption ⋮ 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 ⋮ Digital Signatures ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model ⋮ Provably secure and pairing-free certificateless digital signature scheme using elliptic curve cryptography ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey ⋮ Practical algorithm substitution attack on extractable signatures
Uses Software
This page was built for publication: Security arguments for digital signatures and blind signatures
