A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
From MaRDI portal
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
- 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?)
- 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
- New approaches for deniable authentication
- Non-interactive Deniable Authentication Protocols
- Security proofs for signature schemes
Cited in
(only showing first 100 items - show all)- Auditable asymmetric password authenticated public key establishment
- Hybrid proxy multisignature: a new type multi-party signature
- Key Substitution in the Symbolic Analysis of Cryptographic Protocols
- Fine-grained forward-secure signature schemes without random oracles
- A Generic Construction for Universally-Convertible Undeniable Signatures
- Proxy signature with revocation
- Adaptive succinct garbled RAM or: how to delegate your database
- Towards a theory of data entanglement
- Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA
- New number-theoretic cryptographic primitives
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Security analysis of RSA-BSSA
- Hash Functions from Sigma Protocols and Improvements to VSH
- Equivocal Blind Signatures and Adaptive UC-Security
- Digital Signatures with Memory-Tight Security in the Multi-challenge Setting
- A Generic Framework for Accountable Optimistic Fair Exchange Protocol
- Selected Areas in Cryptography
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- A provably secure short signature scheme based on discrete logarithms
- scientific article; zbMATH DE number 5009202 (Why is no real title available?)
- Blind attribute-based encryption and oblivious transfer with fine-grained access control
- Batch RSA
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- On tight security proofs for Schnorr signatures
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- A generic construction of tightly secure signatures in the multi-user setting
- Cryptography and cryptographic protocols
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Scalable Divisible E-cash
- The security of the cipher block chaining message authentication code
- Server-Aided Verification Signatures: Definitions and New Constructions
- Short undeniable signatures based on group homomorphisms
- On fast and provably secure message authentication based on universal hashing
- Robust threshold DSS signatures
- Time-selective convertible undeniable signatures with short conversion receipts
- Hash your keys before signing. BUFF security of the additional NIST PQC signatures
- Short Transitive Signatures for Directed Trees
- How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
- scientific article; zbMATH DE number 5009192 (Why is no real title available?)
- (Almost) optimal constructions of UOWHFs from 1-to-1, regular one-way functions and beyond
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Chosen ciphertext secure authenticated group communication using identity-based signcryption
- Long-term security and universal composability
- cMix: mixing with minimal real-time asymmetric cryptographic operations
- Tightly secure signatures from lossy identification schemes
- Hybrid commitments and their applications to zero-knowledge proof systems
- Asymptotically Efficient Lattice-Based Digital Signatures
- Post-quantum secure ZRTP
- The wonderful world of global random oracles
- A Storage Efficient Redactable Signature in the Standard Model
- Efficient and Short Certificateless Signature
- Improved threshold signatures, proactive secret sharing, and input certification from LSS isomorphisms
- Quantum digital signature with continuous-variable
- Attestation waves: platform trust via remote power analysis
- Issuer-hiding attribute-based credentials
- Two Notes on the Security of Certificateless Signatures
- A Cartesian product construction for unconditionally secure authentication codes that permit arbitration
- Instance-hiding interactive proofs
- Asymmetric Group Key Agreement
- Programmable Hash Functions and Their Applications
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- Public key encryption with hierarchical authorized keyword search
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
- Message-restriction-free commitment scheme based on lattice assumption
- Ring trapdoor redactable signatures from lattice
- A novel certificateless multi-signature scheme over NTRU lattices
- An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
- Fully adaptive Schnorr threshold signatures
- Anamorphic signatures with dictator and recipient unforgeability for long messages
- More efficient digital signatures with tight multi-user security
- Practical and provably-secure commitment schemes from collision-free hashing
- A meta-complexity theoretic approach to indistinguishability obfuscation and witness pseudo-canonicalization
- An unstoppable ideal functionality for signatures and a modular analysis of the Dolev-Strong broadcast
- NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES
- Towards tightly secure short linearly homomorphic signatures
- Authenticated encryption: relations among notions and analysis of the generic composition paradigm
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- The security of ML-DSA against fault-injection attacks
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Proof-of-reputation blockchain with Nakamoto fallback
- MMH: Software message authentication in the Gbit/second rates
- Adaptive partitioning
- On the security of RSA with primes sharing least-significant bits
- A one-time signature using run-length encoding
- On security preserving reductions -- revised terminology
- On Provable Security of UOV and HFE Signature Schemes against Chosen-Message Attack
- Public key signatures in the multi-user setting.
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Lattice-based signatures with tight adaptive corruptions and more
- Several cryptographic applications of \(\Sigma\)-protocol
- Secure distributed storage and retrieval
- Synchronized aggregate signature under standard assumption in the random oracle model
- Security analysis of randomize-hash-then-sign digital signatures
- Reducing complexity assumptions for statistically-hiding commitment
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Key regeneration-free ciphertext-policy attribute-based encryption and its application
- Certificateless signature: a new security model and an improved generic construction
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Efficient arbitrated quantum signature and its proof of security
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)