Programmable Hash Functions and Their Applications
From MaRDI portal
Recommendations
- Programmable hash functions and their applications
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Short signatures from weaker assumptions
- Programmable hash functions in the multilinear setting
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- General Ad Hoc Encryption from Exponent Inversion IBE
- scientific article; zbMATH DE number 4057443 (Why is no real title available?)
- scientific article; zbMATH DE number 176568 (Why is no real title available?)
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 1406782 (Why is no real title available?)
- On the Generic Insecurity of the Full Domain Hash
- Practical Identity-Based Encryption Without Random Oracles
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- The exact security of digital signatures -- how to sign with RSA and Rabin
Cited in
(42)- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Confined guessing: new signatures from standard assumptions
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- How (not) to design strong-RSA signatures
- Parameterized hash functions
- Lattice-based completely non-malleable public-key encryption in the standard model
- Tight security for signature schemes without random oracles
- On the impossibility of purely algebraic signatures
- Verifiable random functions from standard assumptions
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Programmable hash functions in the multilinear setting
- Short attribute-based signatures for threshold predicates
- Two-dimensional representation of cover free families and its applications: short signatures and more
- Short signatures from weaker assumptions
- Ambiguous one-move nominative signature without random oracles
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Programmable hash functions and their applications
- Non-adaptive programmability of random oracle
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Cryptographic Hash Functions and Some Applications to Information Security
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Predictable arguments of knowledge
- The power of undirected rewindings for adaptive security
- Adaptive-Secure VRFs with Shorter Keys from Static Assumptions
- A New Design of Online/Offline Signatures Based on Lattice
- Lattice-based programmable hash functions and applications
- Efficient traceable signatures in the standard model
- CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not $$\mathtt {q}$$ -type) Assumptions
- Adaptively secure identity-based encryption from middle-product learning with errors
- Straight-line knowledge extraction for multi-round protocols
- Tighter adaptive IBEs and VRFs: revisiting Waters' artificial abort
- SoK: signatures with randomizable keys
- Tightly-secure blind signatures in pairing-free groups
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model
- Generic construction for tightly-secure signatures from discrete log
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
- Linearly homomorphic structure-preserving signatures and their applications
This page was built for publication: Programmable Hash Functions and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600211)
