Pages that link to "Item:Q1912770"
From MaRDI portal
The following pages link to On-line/off-line digital signatures (Q1912770):
Displaying 49 items.
- Tightly secure signatures and public-key encryption (Q300383) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Constant-size structure-preserving signatures: generic constructions and simple assumptions (Q321316) (← links)
- Signcryption with fast online signing and short signcryptext for secure and private mobile communication (Q362175) (← links)
- Authenticated adversarial routing (Q484328) (← links)
- A characterization of chameleon hash functions and new, efficient designs (Q484332) (← links)
- A digital signature with multiple subliminal channels and its applications (Q604079) (← links)
- Generic security-amplifying methods of ordinary digital signatures (Q712706) (← links)
- Efficient generic on-line/off-line (threshold) signatures without key exposure (Q955733) (← links)
- A one-time signature using run-length encoding (Q975441) (← links)
- \(\mathcal H\)-OCSP: A protocol to reduce the processing burden in online certificate status validation (Q1020575) (← links)
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles (Q1034629) (← links)
- On the security of the WOTS-PRF signature scheme (Q1726024) (← links)
- ``Oops, I did it again'' -- security of one-time signatures under two-message attacks (Q1746975) (← links)
- Robust encryption (Q1753165) (← links)
- Further results on asymmetric authentication schemes (Q1854283) (← links)
- How to sign digital streams (Q1854413) (← links)
- An efficient online/offline ID-based short signature procedure using extended chaotic maps (Q2001147) (← links)
- Verifier-based anonymous password-authenticated key exchange protocol in the standard model (Q2160724) (← links)
- Hiding in plain sight: memory-tight proofs via randomness programming (Q2170068) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- Efficient fully structure-preserving signatures and shrinking commitments (Q2318093) (← links)
- Asymptotically efficient lattice-based digital signatures (Q2413615) (← links)
- A generic construction of tightly secure signatures in the multi-user setting (Q2419110) (← links)
- A secure and efficient on-line/off-line group key distribution protocol (Q2420472) (← links)
- An Efficient Post-Quantum One-Time Signature Scheme (Q2807220) (← links)
- Offline Witness Encryption (Q2822676) (← links)
- How to Obtain Fully Structure-Preserving (Automorphic) Signatures from Structure-Preserving Ones (Q2953786) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves (Q2975793) (← links)
- One-Time Signatures and Chameleon Hash Functions (Q3084263) (← links)
- The Symbiosis between Collision and Preimage Resistance (Q3104691) (← links)
- Improved Identity-Based Online/Offline Encryption (Q3194595) (← links)
- Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions (Q3454585) (← links)
- Structure-Preserving Signatures from Standard Assumptions, Revisited (Q3457070) (← links)
- Identity-Based Online/Offline Encryption (Q3603012) (← links)
- Divisible On-Line/Off-Line Signatures (Q3623042) (← links)
- Collusion-Resistant Message Authentication in Overlay Multicast Communication (Q3627419) (← links)
- Secure and efficient off-line digital money (extended abstract) (Q4630266) (← links)
- Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes (Q5041167) (← links)
- Security analysis of the W-OTS$^+$ signature scheme: Updating security bounds (Q5071468) (← links)
- Asymptotically Efficient Lattice-Based Digital Signatures (Q5445497) (← links)
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles (Q5502754) (← links)
- On the Security of Online/Offline Signatures and Multisignatures from ACISP’06 (Q5502755) (← links)
- Chameleon-Hashes with Ephemeral Trapdoors (Q5738755) (← links)
- Homomorphic signatures for subset and superset mixed predicates and its applications (Q6535490) (← links)
- Bringing order to chaos: the case of collision-resistant chameleon-hashes (Q6595845) (← links)
- SDitH in the QROM (Q6595928) (← links)
- Revocable policy-based chameleon hash using lattices (Q6657367) (← links)
