Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
From MaRDI portal
Publication:1671634
DOI10.1007/S10623-017-0444-3zbMath1408.94929OpenAlexW2774928660WikidataQ123160877 ScholiaQ123160877MaRDI QIDQ1671634
Dario Catalano, Luca Nizzardo, Dario Fiore
Publication date: 6 September 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://oa.upm.es/49519/
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 from Lattices: Short Signatures and IBEs with Small Key Sizes
- Programmable Hash Functions in the Multilinear Setting
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Fully Homomorphic Message Authenticators
- Automated Analysis of Cryptographic Assumptions in Generic Group Models
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Structure-Preserving Signatures from Type II Pairings
- Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More
- Computing on Authenticated Data
- 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
- Leveled Fully Homomorphic Signatures from Standard Lattices
- 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
- Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
- 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
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- 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
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
This page was built for publication: Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
