Homomorphic Signatures with Efficient Verification for Polynomial Functions

DOI10.1007/978-3-662-44371-2_21zbMath1345.94049OpenAlexW1592648764MaRDI QIDQ2874515

Dario Catalano, Bogdan Warinschi, Dario Fiore

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44371-2_21

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (19)

On the (In)Security of SNARKs in the Presence of Oracles ⋮ Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Batch verifiable computation of outsourced functions ⋮ Private polynomial commitments and applications to MPC ⋮ Multi-key Homomorphic Authenticators ⋮ Structure-preserving linearly homomorphic signature with designated combiner for subspace ⋮ Function-Dependent Commitments for Verifiable Multi-party Computation ⋮ CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation ⋮ Progressive and efficient verification for digital signatures

This page was built for publication: Homomorphic Signatures with Efficient Verification for Polynomial Functions