Security arguments for digital signatures and blind signatures
From MaRDI portal
Publication:1573771
DOI10.1007/s001450010003zbMath1025.94015OpenAlexW2169194339WikidataQ56921502 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
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, Digital signature scheme set in a hidden cyclic group, Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures, FROST: Flexible round-optimized Schnorr threshold signatures, Identity-based undetachable digital signature for mobile agents in electronic commerce, A closer look at multiple forking: leveraging (in)dependence for a tighter bound, Structure-preserving signatures and commitments to group elements, A novel version of the hidden logarithm problem for post-quantum signature algorithms, Fiat-Shamir for highly sound protocols is instantiable, Provably secure and pairing-based strong designated verifier signature scheme with message recovery, Privacy-preserving file sharing on cloud storage with certificateless signcryption, Provably secure pairing-free identity-based partially blind signature scheme and its application in online E-cash system, Tightly secure signatures from lossy identification schemes, Efficient discrete logarithm based multi-signature scheme in the plain public key model, BlindOR: an efficient lattice-based blind signature scheme from OR-proofs, Distributed ring signatures from general dual access structures, Identity-based signature scheme based on quadratic residues, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, Robust subgroup multi-signatures for consensus, The wonderful world of global random oracles, An efficient multi-receipt mechanism for uncoercible anonymous electronic voting, Identity based signature scheme based on cubic residues, A correction to a code-based blind signature scheme, Security of blind signatures revisited, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, 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, A provable secure fuzzy identity based signature scheme, Group signatures and more from isogenies and lattices: generic, simple, and efficient, Short pairing-free blind signatures with exponential security, Chosen ciphertext secure authenticated group communication using identity-based signcryption, The random oracle model: a twenty-year retrospective, Provably secure proxy signature scheme from factorization, Extending concurrent signature to multiple parties, Certificateless message recovery signatures providing Girault's level-3 security, An efficient certificateless aggregate signature without pairings for vehicular ad hoc networks, A note on an identity-based ring signature scheme with signer verifiability, Secure proxy signature schemes for delegation of signing rights, Improved convertible authenticated encryption scheme with provable security, Efficient traceable signatures in the standard model, Cryptanalysis of a code-based one-time signature, Group-oriented fair exchange of signatures, Group-oriented setting's multisigncryption scheme with threshold designcryption, CMQV+: an authenticated key exchange protocol from CMQV, Attribute-based signatures from RSA, Efficient certificateless proxy signature scheme with provable security, On the tightness of forward-secure signature reductions, A note on asynchronous multi-exponentiation algorithm using binary representation, An efficient eCK secure identity based two party authenticated key agreement scheme with security against active adversaries, Certificate-based verifiably encrypted signatures from pairings, An efficient identity based generalized signcryption scheme, Provably secure and efficient proxy signature with untrustworthy proxy signer, Concurrent signature without random oracles, Identity-based deniable authentication for ad hoc networks, Privacy-preserving certificateless provable data possession scheme for big data storage on cloud, A novel authenticated encryption scheme and its extension, Efficient generic on-line/off-line (threshold) signatures without key exposure, A high capacity quantum weak blind signature based on logistic chaotic maps, Cryptanalysis and improvement of a certificateless aggregate signature scheme, Zero-knowledge argument for simultaneous discrete logarithms, An ID-based multi-signer universal designated multi-verifier signature scheme, On the unlinkability of randomization-enhanced Chaum's blind signature scheme, Provably convertible multi-authenticated encryption scheme for generalized group communications, Generic security-amplifying methods of ordinary digital signatures, Provably secure and efficient identification and key agreement protocol with user anonymity, Security of self-certified signatures, Policy controlled system with anonymity, Strongly secure identity-based authenticated key agreement protocols without bilinear pairings, Certificate-free \textit{ad hoc} anonymous authentication, Notes on a group-oriented setting's multisigncryption scheme with threshold designcryption, Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model, 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, Forgeability of Wang-Zhu-Feng-Yau's attribute-based signature with policy-and-endorsement mechanism, 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, Security proofs for identity-based identification and signature schemes, Identity-based signatures in standard model, Simple Schnorr multi-signatures with applications to bitcoin, Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol, Lattice-based revocable certificateless signature, A pairing-based three-party authenticated encryption scheme without shared secrets, Anonymous tokens with private metadata bit, Lattice-based blind signatures, revisited, Public key signatures in the multi-user setting., New code-based cryptographic accumulator and fully dynamic group signature, A QDS scheme based on superdense teleportation, Improving the exact security of digital signature schemes, Practical (fully) distributed signatures provably secure in the standard model, Combined schemes for signature and encryption: the public-key and the identity-based setting, Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model, Efficient lattice-based blind signatures via Gaussian one-time signatures, What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?, Non-interactive Mimblewimble transactions, revisited, Nostradamus goes quantum, \textsf{CSI-Otter}: isogeny-based (partially) blind signatures from the class group action with a twist, PointProofs, revisited, The Abe-Okamoto partially blind signature scheme revisited, Fully adaptive Schnorr threshold signatures, Snowblind: a threshold blind signature in pairing-free groups, Practical Schnorr threshold signatures without the algebraic group model, 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
Uses Software
