A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

Recommendations

scientific article; zbMATH DE number 5009202
Selected Areas in Cryptography
Adaptively secure strong designated signature
scientific article; zbMATH DE number 5009192
Hash-based signatures revisited: a dynamic FORS with adaptive chosen message security
Adaptively secure threshold signature scheme in the standard model
scientific article; zbMATH DE number 2009970
scientific article; zbMATH DE number 1418310
scientific article; zbMATH DE number 1583774

Cites work

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
A public key cryptosystem and a signature scheme based on discrete logarithms
Composability and On-Line Deniability of Authentication
Concurrent zero-knowledge
Designated verifier proofs and their applications
scientific article; zbMATH DE number 4191111 (Why is no real title available?)
scientific article; zbMATH DE number 1302854 (Why is no real title available?)
scientific article; zbMATH DE number 1775427 (Why is no real title available?)
scientific article; zbMATH DE number 1406779 (Why is no real title available?)
New approaches for deniable authentication
Non-interactive Deniable Authentication Protocols
Security proofs for signature schemes

Cited in

(only showing first 100 items - show all)

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
Efficient Rabin-type digital signature scheme
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 loss of unique signatures
The wonderful world of global random oracles
Public key compression for constrained linear signature schemes
Identity-based quotable ring signature
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
Bonsai trees, or how to delegate a lattice basis
Batch verification of short signatures
Security analysis of randomize-hash-then-sign digital signatures
Non-interactive multisignatures in the plain public-key model with efficient verification
One-way functions using algorithmic and classical information theories
Practical chosen ciphertext secure encryption from factoring
Leakage-resilient group signature: definitions and constructions
Efficient digital signatures from RSA without random oracles
Confined guessing: new signatures from standard assumptions
New number-theoretic cryptographic primitives
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
Banquet: short and fast signatures from AES
More efficient digital signatures with tight multi-user security
A blind signature scheme based on bilinear pairings
Short identity-based signatures with tight security from lattices
On the round complexity of randomized Byzantine agreement
An intermediate secret-guessing attack on hash-based signatures
MoSS: modular security specifications framework
Quantum digital signature with continuous-variable
Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
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
A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
Malleability and ownership of proxy signatures: towards a stronger definition and its limitations
Joint state composition theorems for public-key encryption and digital signature functionalities with local computation
New methods and abstractions for RSA-based forward secure signatures
The lattice-based digital signature scheme qTESLA
Signcryption from randomness recoverable public key encryption
On the relationship between statistical zero-knowledge and statistical randomized encodings
A generic framework for accountable optimistic fair exchange protocol
Efficient fully structure-preserving signatures and shrinking commitments
Tightly secure signature schemes from the LWE and subset sum assumptions
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
Mercurial commitments with applications to zero-knowledge sets
Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
Certificateless signature: a new security model and an improved generic construction
Fully leakage-resilient signatures
Short signatures from Diffie-Hellman: realizing almost compact public key
Asymptotically efficient lattice-based digital signatures
A generic construction of tightly secure signatures in the multi-user setting
Algorand: a secure and efficient distributed ledger
Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
On tight security proofs for Schnorr signatures
Short signatures without random oracles and the SDH assumption in bilinear groups
Lower bounds and impossibility results for concurrent self composition
Universally composable symbolic security analysis
How (not) to design strong-RSA signatures
Security weaknesses in arbitrated quantum signature protocols
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
Tight security for 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
Authenticated broadcast with a partially compromised public-key infrastructure
Key regeneration-free ciphertext-policy attribute-based encryption and its application
A novel identity-based multi-signature scheme over NTRU lattices
Algebraic and quantum attacks on two digital signature schemes
Quantum digital signature based on measurement-device-independent continuous-variable scheme
Practical dynamic group signatures without knowledge extractors
Concurrent knowledge extraction in public-key models
Scalable Divisible E-cash
Proxy signature with revocation
Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
Optimal security proofs for signatures from identification schemes
On the relationship between statistical zero-knowledge and statistical randomized encodings

This page was built for publication: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787914)