Programmable hash functions in the multilinear setting
From MaRDI portal
Publication:2845692
DOI10.1007/978-3-642-40041-4_28zbMATH Open1310.94145OpenAlexW199192073MaRDI QIDQ2845692FDOQ2845692
Authors: Eduarda S. V. Freire, Dennis Hofheinz, Kenneth G. Paterson, Christoph Striecks 
Publication date: 2 September 2013
Published in: Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40041-4_28
Recommendations
- Programmable Hash Functions and Their Applications
- Programmable hash functions and their applications
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
digital signaturesidentity-based encryptionmultilinear mapsprogrammable hash functionsidentity-based non-interactive key exchange
Cited In (27)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- On Building Hash Functions from Multivariate Quadratic Equations
- Locally verifiable signature and key aggregation
- Adaptively secure distributed PRFs from LWE
- Multilinear maps from obfuscation
- Programmable hash functions and their applications
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- Multilinear maps from obfuscation
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Lattice-based programmable hash functions and applications
- Programmable Hash Functions and Their Applications
- The random oracle model: a twenty-year retrospective
- Linear hash functions
- Constrained PRFs for unbounded inputs with short keys
- Privately puncturing PRFs from lattices: adaptive security and collusion resistant pseudorandomness
- Verifiable random functions from standard assumptions
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Monotone-policy aggregate signatures
- Fuzzy matching and direct revocation: a new CP-ABE scheme from multilinear maps
- Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- Applications of hashing in algebraic manipulation (an annotated bibliography)
- Public-key authenticated encryption with keyword search revisited: security model and constructions
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Identity-based aggregate signcryption in the standard model from multilinear maps
- On instantiating the algebraic group model from falsifiable assumptions
This page was built for publication: Programmable hash functions in the multilinear setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845692)
