Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
From MaRDI portal
(Redirected from Publication:3457069)
Recommendations
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Programmable Hash Functions and Their Applications
- Programmable hash functions and their applications
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Short signatures from weaker assumptions
Cites work
- Adaptive pseudo-free groups and applications
- 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
- Efficient network coding signatures in the standard model
- Families of finite sets in which no set is covered by the union of \(r\) others
- Fully homomorphic message authenticators
- Homomorphic network coding signatures in the standard model
- Homomorphic signatures for polynomial functions
- Improved security for linearly homomorphic signatures: a generic framework
- Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Practical adaptive oblivious transfer from simple assumptions
- Programmable Hash Functions and Their Applications
- Programmable hash functions and their applications
- Programmable hash functions in the multilinear setting
- Secure network coding over the integers
- Short signatures from weaker assumptions
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model
- Two-dimensional representation of cover free families and its applications: short signatures and more
Cited in
(19)- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- 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
- Subversion-resilient enhanced privacy ID
- A compiler for multi-key homomorphic signatures for Turing machines
- Linearly homomorphic signatures with designated combiner
- Verifiable pattern matching on outsourced texts
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Programmable hash functions in the multilinear setting
- On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
- Multi-key Homomorphic Authenticators
- Programmable Hash Functions and Their Applications
- Programmable hash functions and their applications
- Function-Dependent Commitments for Verifiable Multi-party Computation
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- Lattice-based programmable hash functions and applications
- On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions
- Fully-succinct multi-key homomorphic signatures from standard assumptions
This page was built for publication: Programmable hash functions go private: constructions and applications to (homomorphic) signatures with shorter public keys
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457069)
