On-line/off-line digital signatures
From MaRDI portal
Publication:1912770
DOI10.1007/BF02254791zbMath0844.94011WikidataQ56570666 ScholiaQ56570666MaRDI QIDQ1912770
Shimon Even, Oded Goldreich, Silvio Micali
Publication date: 20 August 1996
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes, Tightly secure signatures and public-key encryption, Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions, Tightly secure signatures from lossy identification schemes, Structure-Preserving Signatures from Standard Assumptions, Revisited, Constant-size structure-preserving signatures: generic constructions and simple assumptions, Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds, Improved Identity-Based Online/Offline Encryption, Verifier-based anonymous password-authenticated key exchange protocol in the standard model, Signcryption with fast online signing and short signcryptext for secure and private mobile communication, Hiding in plain sight: memory-tight proofs via randomness programming, A digital signature with multiple subliminal channels and its applications, Asymptotically efficient lattice-based digital signatures, A generic construction of tightly secure signatures in the multi-user setting, A secure and efficient on-line/off-line group key distribution protocol, How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones, On-line/off-line DCR-based homomorphic encryption and applications, Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, A New Design of Online/Offline Signatures Based on Lattice, Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves, On the security of the WOTS-PRF signature scheme, Secure and efficient off-line digital money (extended abstract), Authenticated adversarial routing, A characterization of chameleon hash functions and new, efficient designs, ``Oops, I did it again -- security of one-time signatures under two-message attacks, Efficient generic on-line/off-line (threshold) signatures without key exposure, Robust encryption, An efficient online/offline ID-based short signature procedure using extended chaotic maps, Chameleon-Hashes with Ephemeral Trapdoors, A one-time signature using run-length encoding, Efficient hybrid encryption from ID-based encryption, Generic security-amplifying methods of ordinary digital signatures, Identity-Based Online/Offline Encryption, Asymptotically Efficient Lattice-Based Digital Signatures, An Efficient Post-Quantum One-Time Signature Scheme, Divisible On-Line/Off-Line Signatures, Collusion-Resistant Message Authentication in Overlay Multicast Communication, One-Time Signatures and Chameleon Hash Functions, \(\mathcal H\)-OCSP: A protocol to reduce the processing burden in online certificate status validation, Offline Witness Encryption, Efficient fully structure-preserving signatures and shrinking commitments, The Symbiosis between Collision and Preimage Resistance, Direct chosen-ciphertext secure identity-based key encapsulation without random oracles, An Efficient On-Line/Off-Line Signature Scheme without Random Oracles, On the Security of Online/Offline Signatures and Multisignatures from ACISP’06, Further results on asymmetric authentication schemes, How to sign digital streams
Cites Work
- Differential cryptanalysis of DES-like cryptosystems
- One way functions and pseudorandom generators
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A modification of the RSA public-key encryption procedure (Corresp.)
- A method for obtaining digital signatures and public-key cryptosystems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
