A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

DOI10.1137/0217017zbMath0644.94012OpenAlexW2151413173WikidataQ55954461 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

Cryptography (94A60)

Related Items

An efficient and secure identity based multiple signatures scheme based on RSA, Witness Maps and Applications, LegRoast: Efficient Post-quantum Signatures from the Legendre PRF, UC Updatable Databases and Applications, Message-Restriction-Free Commitment Scheme Based on Lattice Assumption, Ring Trapdoor Redactable Signatures from Lattice, A Novel Certificateless Multi-signature Scheme over NTRU Lattices, Unconditional Byzantine agreement for any number of faulty processors, Communication efficient Zero-knowledge Proofs of knowledge, Digital Signatures with Memory-Tight Security in the Multi-challenge Setting, An efficient identity-based signature scheme with provable security, Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA, Security analysis of RSA-BSSA, Locally verifiable signature and key aggregation, Enhanced Security of Attribute-Based Signatures, Protean Signature Schemes, A Generic Framework for Accountable Optimistic Fair Exchange Protocol, Half-aggregation of Schnorr signatures with tight reductions, Attribute based tracing for securing group signatures against centralized authorities, Lattice-based signatures with tight adaptive corruptions and more, On the impossibility of algebraic vector commitments in pairing-free groups, Identity-based matchmaking encryption from standard assumptions, The power of undirected rewindings for adaptive security, A New Design of Online/Offline Signatures Based on Lattice, Auditable asymmetric password authenticated public key establishment, Better than advertised security for non-interactive threshold signatures, Public key encryption with hierarchical authorized keyword search, Fully adaptive Schnorr threshold signatures, Factorization, malleability and equivalent problems, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks, Grid-Obstacle Representations with Connections to Staircase Guarding, Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs, Cryptography and cryptographic protocols, Delegation of cryptographic servers for capture-resilient devices, Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations, MMH: Software message authentication in the Gbit/second rates, Атаки на схемы электронной подписи, не учитываемые традиционными определениями стойкости, и меры противодействия им, The security of the cipher block chaining message authentication code, Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures, Chameleon-Hashes with Ephemeral Trapdoors, Cut Down the Tree to Achieve Constant Complexity in Divisible E-cash, Masking the GLP lattice-based signature scheme at any order, 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, 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, Threshold-directed signature scheme based on hybrid number theoretic problems, How to Use Indistinguishability Obfuscation: Deniable Encryption, and More, 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, Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments, Quantum blind signature with an offline repository, On the security of some variants of the RSA signature scheme, Adaptive Partitioning, Symmetric Authentication within a Simulatable Cryptographic Library, Short Transitive Signatures for Directed Trees, Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More, Merkle tree digital signature and trusted computing platform, Anonymous Communication and Anonymous Cash, Security of 2t-Root Identification and Signatures, Robust and Efficient Sharing of RSA Functions, New Generation of Secure and Practical RSA-Based Signatures, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, On Fast and Provably Secure Message Authentication Based on Universal Hashing, Mercurial commitments with applications to zero-knowledge sets, Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles, (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond, Adaptive Succinct Garbled RAM or: How to Delegate Your Database, Authenticated broadcast with a partially compromised public-key infrastructure, Certificateless signature: a new security model and an improved generic construction, Provable security of digital signatures in the tamper-proof device model, A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption, Fully leakage-resilient signatures, Key regeneration-free ciphertext-policy attribute-based encryption and its application, Malleability and ownership of proxy signatures: towards a stronger definition and its limitations, Short signatures from Diffie-Hellman: realizing almost compact public key, Asymptotically efficient lattice-based digital signatures, Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy, A novel identity-based multi-signature scheme over NTRU lattices, A generic construction of tightly secure signatures in the multi-user setting, From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures, Adaptive Oblivious Transfer and Generalization, From Identification to Signatures, Tightly: A Framework and Generic Transforms, Algorand: a secure and efficient distributed ledger, 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, Structure-preserving signatures on equivalence classes and constant-size anonymous credentials, On tight security proofs for Schnorr signatures, Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography, Trapdoor Sanitizable Signatures and Their Application to Content Protection, Short signatures without random oracles and the SDH assumption in bilinear groups, Lower bounds and impossibility results for concurrent self composition, Algebraic and quantum attacks on two digital signature schemes, Universally composable symbolic security analysis, Quantum digital signature based on measurement-device-independent continuous-variable scheme, How (not) to design strong-RSA signatures, Practical dynamic group signatures without knowledge extractors, Joint state composition theorems for public-key encryption and digital signature functionalities with local computation, One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model, Security weaknesses in arbitrated quantum signature protocols, Digital Signatures Out of Second-Preimage Resistant Hash Functions, Anonymous Proxy Signatures, Proxy Re-signatures in the Standard Model, Authentic Quantum Nonces, A provably secure short signature scheme based on discrete logarithms, Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks, New methods and abstractions for RSA-based forward secure signatures, The lattice-based digital signature scheme qTESLA, Applications of Signcryption, 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, On the Security of the Winternitz One-Time Signature Scheme, Adaptively Secure Non-interactive Threshold Cryptosystems, 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, Signcryption from randomness recoverable public key encryption, 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, On the relationship between statistical zero-knowledge and statistical randomized encodings, Scalable Divisible E-cash, Tight security for signature schemes without random oracles, Security of signature schemes in the presence of key-dependent messages, One-Time Signatures and Chameleon Hash Functions, Proxy Signature with Revocation, On Security Preserving Reductions – Revised Terminology, Cryptographic Verification by Typing for a Sample Protocol Implementation, Threshold-Optimal DSA/ECDSA Signatures and an Application to Bitcoin Wallet Security, 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 generic framework for accountable optimistic fair exchange protocol, Optimal Security Proofs for Signatures from Identification Schemes, On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings, A Storage Efficient Redactable Signature in the Standard Model, On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack, XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions, Efficient fully structure-preserving signatures and shrinking commitments, Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes, 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, Tightly secure signature schemes from the LWE and subset sum assumptions, Cryptanalysis of some signature schemes with message recovery, Generic groups, collision resistance, and ECDSA, Signcryption with non-interactive non-repudiation, An efficient protocol for secure two-party computation in the presence of malicious adversaries, Computing on authenticated data, Sequential aggregate signatures with short public keys without random oracles, A strong designated verifier signature scheme tightly related to the LRSW assumption, On the round complexity of randomized Byzantine agreement, Generic construction for tightly-secure signatures from discrete log, Concurrent knowledge extraction in public-key models, Balancing privacy and accountability in blockchain identity management, An intermediate secret-guessing attack on hash-based signatures, MoSS: modular security specifications framework, On the Clark-Jacob version of SPLICE/AS, Structure-preserving signatures and commitments to group elements, Signature schemes secure against hard-to-invert leakage, On the security loss of unique signatures, Tightly secure signatures and public-key encryption, Blind attribute-based encryption and oblivious transfer with fine-grained access control, Tightly secure signatures from lossy identification schemes, Quantum digital signature with continuous-variable, Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms, Efficient discrete logarithm based multi-signature scheme in the plain public key model, Constant-size structure-preserving signatures: generic constructions and simple assumptions, Efficient threshold-optimal ECDSA, Issuer-hiding attribute-based credentials, Attestation waves: platform trust via remote power analysis, Proof-of-reputation blockchain with Nakamoto fallback, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, The wonderful world of global random oracles, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, Batch RSA, On the existence of statistically hiding bit commitment schemes and fail-stop signatures, On-line/off-line digital signatures, Efficient arbitrated quantum signature and its proof of security, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, Chosen ciphertext secure authenticated group communication using identity-based signcryption, Long-term security and universal composability, An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices, Bonsai trees, or how to delegate a lattice basis, Batch verification of short signatures, Security analysis of randomize-hash-then-sign digital signatures, Identity based identification from algebraic coding theory, How to achieve non-repudiation of origin with privacy protection in cloud computing, Chosen-ciphertext secure bidirectional proxy re-encryption schemes without pairings, Certificateless message recovery signatures providing Girault's level-3 security, Secure proxy signature schemes for delegation of signing rights, Which languages have 4-round zero-knowledge proofs?, Non-interactive multisignatures in the plain public-key model with efficient verification, Efficient traceable signatures in the standard model, One-way functions using algorithmic and classical information theories, Practical chosen ciphertext secure encryption from factoring, Multi-verifier signatures, Provably-secure time-bound hierarchical key assignment schemes, Programmable hash functions and their applications, Provably secure server-aided verification signatures, A Cartesian product construction for unconditionally secure authentication codes that permit arbitration, Short undeniable signatures based on group homomorphisms, A simple transitive signature scheme for directed trees, Certificate-based verifiably encrypted signatures from pairings, Secure computation without authentication, Efficient selective identity-based encryption without random oracles, Public key compression for constrained linear signature schemes, Several cryptographic applications of $\Sigma$-protocol, Sequential aggregate signatures with lazy verification from trapdoor permutations, Optimistic fair exchange in the enhanced chosen-key model, A characterization of chameleon hash functions and new, efficient designs, Non-interactive identity-based threshold signature scheme without random oracles, Simplified small exponent test for batch verification, Practical verifiably encrypted signatures without random oracles, Security of BLS and BGLS signatures in a multi-user setting, Identity-based quotable ring signature, 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, Leakage-resilient group signature: definitions and constructions, Efficient digital signatures from RSA without random oracles, Rogue-key attacks on the multi-designated verifiers signature scheme, On the security of RSA with primes sharing least-significant bits, A survey of symbolic methods in computational analysis of cryptographic systems, Efficient authenticated data structures for graph connectivity and geometric search problems, A one-time signature using run-length encoding, Certificateless undeniable signatures from bilinear maps, Generic security-amplifying methods of ordinary digital signatures, Confined guessing: new signatures from standard assumptions, Time-selective convertible undeniable signatures with short conversion receipts, New number-theoretic cryptographic primitives, Identity-based trapdoor mercurial commitments and applications, An identity-based strongly unforgeable signature without random oracles from bilinear pairings, On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments, Threshold ECDSA with an offline recovery party, Signatures from sequential-OR proofs, Bandwidth-efficient threshold EC-DSA, Authenticated encryption: relations among notions and analysis of the generic composition paradigm, Hybrid commitments and their applications to zero-knowledge proof systems, Banquet: short and fast signatures from AES, More efficient digital signatures with tight multi-user security, Security proofs for identity-based identification and signature schemes, Reducing complexity assumptions for statistically-hiding commitment, New approaches for deniable authentication, Secure distributed storage and retrieval, A blind signature scheme based on bilinear pairings, Public key signatures in the multi-user setting., Robust threshold DSS signatures, How to sign digital streams, Improving the exact security of digital signature schemes, Short identity-based signatures with tight security from lattices

Cites Work