Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
From MaRDI portal
Publication:3457069
DOI10.1007/978-3-662-48000-7_13zbMath1352.94029OpenAlexW1417660680MaRDI QIDQ3457069
Luca Nizzardo, Dario Fiore, Dario Catalano
Publication date: 10 December 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/49538/
Related Items (13)
Subversion-resilient enhanced privacy ID ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Multi-key Homomorphic Authenticators ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ Lattice-based programmable hash functions and applications ⋮ Linearly homomorphic signatures with designated combiner ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
Cites Work
- Programmable hash functions and their applications
- Families of finite sets in which no set is covered by the union of \(r\) others
- Programmable Hash Functions in the Multilinear Setting
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Fully Homomorphic Message Authenticators
- Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More
- Efficient Network Coding Signatures in the Standard Model
- Improved Security for Linearly Homomorphic Signatures: A Generic Framework
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Practical Adaptive Oblivious Transfer from Simple Assumptions
- Homomorphic Signatures for Polynomial Functions
- Adaptive Pseudo-free Groups and Applications
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Homomorphic Network Coding Signatures in the Standard Model
- Short Signatures from Weaker Assumptions
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Secure Network Coding over the Integers
- Programmable Hash Functions and Their Applications
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Algebraic (Trapdoor) One-Way Functions and Their Applications
- Computing on Authenticated Data: New Privacy Definitions and Constructions
- Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
This page was built for publication: Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
