scientific article; zbMATH DE number 1842501
From MaRDI portal
Publication:4783735
zbMath1003.94533MaRDI QIDQ4783735
Publication date: 8 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390355
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ A new universal designated verifier transitive signature scheme for big graph data ⋮ Constant-size structure-preserving signatures: generic constructions and simple assumptions ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Generic Transformation to Strongly Existentially Unforgeable Signature Schemes with Continuous Leakage Resiliency ⋮ Signcryption with fast online signing and short signcryptext for secure and private mobile communication ⋮ Efficient chameleon hash functions in the enhanced collision resistant model ⋮ Efficient traceable ring signature scheme without pairings ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ A secure and efficient on-line/off-line group key distribution protocol ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ A New Design of Online/Offline Signatures Based on Lattice ⋮ How to Build a Hash Function from Any Collision-Resistant Function ⋮ Authenticated adversarial routing ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Identity-based blind signature from lattices ⋮ Efficient generic on-line/off-line (threshold) signatures without key exposure ⋮ An efficient online/offline ID-based short signature procedure using extended chaotic maps ⋮ Chameleon-Hashes with Ephemeral Trapdoors ⋮ VSH, an Efficient and Provable Collision-Resistant Hash Function ⋮ Generic security-amplifying methods of ordinary digital signatures ⋮ Hash Functions from Sigma Protocols and Improvements to VSH ⋮ Certificateless cryptography with KGC trust level 3 ⋮ Identity-Based Online/Offline Encryption ⋮ Tight security for signature schemes without random oracles ⋮ An efficient and secure navigation protocol based on vehicular cloud ⋮ Divisible On-Line/Off-Line Signatures ⋮ One-Time Signatures and Chameleon Hash Functions ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles ⋮ The GPS Identification Scheme Using Frobenius Expansions ⋮ Optimal Online/Offline Signature: How to Sign a Message without Online Computation ⋮ Revocable hierarchical attribute-based signatures from lattices
