On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

DOI10.1007/978-3-642-32009-5_47zbMath1296.94120OpenAlexW2282650164MaRDI QIDQ2914302

Jacob C. N. Schuldt, Takahiro Matsuda, Goichiro Hanaoka

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32009-5_47

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Lattice-based programmable hash functions and applications ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups