Programmable hash functions and their applications
From MaRDI portal
Publication:434345
DOI10.1007/S00145-011-9102-5zbMATH Open1272.94036DBLPjournals/joc/HofheinzK12OpenAlexW3029670809WikidataQ59163693 ScholiaQ59163693MaRDI QIDQ434345FDOQ434345
Authors: Dennis Hofheinz, Eike Kiltz 
Publication date: 10 July 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9102-5
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
- Title not available (Why is that?)
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Practical Identity-Based Encryption Without Random Oracles
- Secure Hash-and-Sign Signatures Without the Random Oracle
- A Pseudorandom Generator from any One-way Function
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identity-Based Encryption from the Weil Pairing
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Efficient Identity-Based Encryption Without Random Oracles
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
- Efficient Authentication from Hard Learning Problems
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Title not available (Why is that?)
- Theory of Cryptography
- Advances in Cryptology – CRYPTO 2004
- Theory of Cryptography
- Zero-knowledge proofs of identity
- Tight proofs for signature schemes without random oracles
- Secure Hybrid Encryption from Weakened Key Encapsulation
- Practical Chosen Ciphertext Secure Encryption from Factoring
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Title not available (Why is that?)
- Asymptotically Efficient Lattice-Based Digital Signatures
- Short and Stateless Signatures from the RSA Assumption
- Security Analysis of the Strong Diffie-Hellman Problem
- Lossy trapdoor functions and their applications
- On the Generic Insecurity of the Full Domain Hash
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- General Ad Hoc Encryption from Exponent Inversion IBE
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- How (not) to design strong-RSA signatures
- Signatures on randomizable ciphertexts
- A CDH-Based Ring Signature Scheme with Short Signatures and Public Keys
- Identity-Based Encryption Gone Wild
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Cramer-Shoup Strong-RSA Signature Scheme Revisited
- Title not available (Why is that?)
- Information Security and Privacy
- Theory of Cryptography
Cited In (19)
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- Cryptographic Hash Functions and Some Applications to Information Security
- Subversion-resilient signatures: definitions, constructions and applications
- Practical algorithm substitution attack on extractable signatures
- Parameterized hash functions
- Efficient digital signatures from RSA without random oracles
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Lattice-based programmable hash functions and applications
- Programmable Hash Functions and Their Applications
- Short signatures from weaker assumptions
- Anonymous and leakage resilient IBE and IPE
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Optimistic fair exchange in the enhanced chosen-key model
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
- Compact Ring Signature in the Standard Model for Blockchain
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Leakage-resilient ring signature schemes
- On instantiating the algebraic group model from falsifiable assumptions
Uses Software
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 Q434345)
