A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

DOI10.1137/0217017zbMath0644.94012WikidataQ55954461 ScholiaQ55954461MaRDI QIDQ3787914

Shafi Goldwasser, Ronald L. Rivest, Silvio Micali

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1df94b5f37d896309e47160c7e2b4230c0ce608c

zbMATH Keywords

randomization; digital signature; authentication; integer factorization; trap-door permutations

Mathematics Subject Classification ID

94A60: Cryptography

Related Items

A Suite of Non-pairing ID-Based Threshold Ring Signature Schemes with Different Levels of Anonymity (Extended Abstract), Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures, Proxy Signatures Secure Against Proxy Key Exposure, Security of Digital Signature Schemes in Weakened Random Oracle Models, Asymptotically Efficient Lattice-Based Digital Signatures, Equivocal Blind Signatures and Adaptive UC-Security, Faster and Shorter Password-Authenticated Key Exchange, Verifier-Key-Flexible Universal Designated-Verifier Signatures, Proxy Re-signature Schemes Without Random Oracles, A Generic Construction for Universally-Convertible Undeniable Signatures, Efficient ID-Based Digital Signatures with Message Recovery, Threshold RSA for Dynamic and Ad-Hoc Groups, Key Substitution in the Symbolic Analysis of Cryptographic Protocols, Efficient and Short Certificateless Signature, An Efficient On-Line/Off-Line Signature Scheme without Random Oracles, Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme, Round-Optimal Blind Signatures from Waters Signatures, Server-Aided Verification Signatures: Definitions and New Constructions, How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions, The security of the cipher block chaining message authentication code, Chosen ciphertext secure authenticated group communication using identity-based signcryption, Long-term security and universal composability, Efficient discrete logarithm based multi-signature scheme in the plain public key model, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices, A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, A simple transitive signature scheme for directed trees, Certificate-based verifiably encrypted signatures from pairings, Non-interactive identity-based threshold signature scheme without random oracles, A new framework for the design and analysis of identity-based identification schemes, Two-factor mutual authentication based on smart cards and passwords, Efficient generic on-line/off-line (threshold) signatures without key exposure, Rogue-key attacks on the multi-designated verifiers signature scheme, A one-time signature using run-length encoding, Time-selective convertible undeniable signatures with short conversion receipts, Authenticated encryption: relations among notions and analysis of the generic composition paradigm, Hybrid commitments and their applications to zero-knowledge proof systems, Security proofs for identity-based identification and signature schemes, Reducing complexity assumptions for statistically-hiding commitment, New approaches for deniable authentication, Batch RSA, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, Secure distributed storage and retrieval, Improving the exact security of digital signature schemes, On the security of RSA with primes sharing least-significant bits, Public key signatures in the multi-user setting., Robust threshold DSS signatures, How to sign digital streams, On-line/off-line digital signatures, Signcryption from randomness recoverable public key encryption, Certificateless signature: a new security model and an improved generic construction, Short signatures without random oracles and the SDH assumption in bilinear groups, Lower bounds and impossibility results for concurrent self composition, A provably secure short signature scheme based on discrete logarithms, Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks, Hybrid proxy multisignature: a new type multi-party signature, Towards a theory of data entanglement, New \((t, n)\) threshold directed signature scheme with provable security, Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs, Cryptanalysis of ISO/IEC 9796-1, Breaking and fixing public-key Kerberos, Fine-grained forward-secure signature schemes without random oracles, Cryptanalysis of some signature schemes with message recovery, Generic groups, collision resistance, and ECDSA, Signcryption with non-interactive non-repudiation, Provable security of digital signatures in the tamper-proof device model, Security of Verifiably Encrypted Signatures and a Construction without Random Oracles, Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures, Universally Composable Adaptive Priced Oblivious Transfer, A Storage Efficient Redactable Signature in the Standard Model, A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems, Leakage-Resilient Signatures, Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs, Merkle tree digital signature and trusted computing platform, A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function, Two Notes on the Security of Certificateless Signatures, Formal Security Treatments for Signatures from Identity-Based Encryption, Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography, Trapdoor Sanitizable Signatures and Their Application to Content Protection, Digital Signatures Out of Second-Preimage Resistant Hash Functions, Anonymous Proxy Signatures, Proxy Re-signatures in the Standard Model, VSH, an Efficient and Provable Collision-Resistant Hash Function, Sequential Aggregate Signatures and Multisignatures Without Random Oracles, Programmable Hash Functions and Their Applications, Hash Functions from Sigma Protocols and Improvements to VSH, NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES, Divisible On-Line/Off-Line Signatures, On Randomizing Hash Functions to Strengthen the Security of Digital Signatures, Asymmetric Group Key Agreement, Realizing Hash-and-Sign Signatures under Standard Assumptions, Anonymous Consecutive Delegation of Signing Rights: Unifying Group and Proxy Signatures, Hash function requirements for Schnorr signatures, A designated verifier signature using secret sharing technique, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

Cites Work