Homomorphic Signatures for Polynomial Functions
From MaRDI portal
Publication:3003381
DOI10.1007/978-3-642-20465-4_10zbMath1281.94072OpenAlexW2147412664MaRDI QIDQ3003381
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_10
Related Items (40)
Short Transitive Signatures for Directed Trees ⋮ Lattice-based linearly homomorphic signatures in the standard model ⋮ Linearly Homomorphic Signatures with Designated Entities ⋮ Trapdoors for Ideal Lattices with Applications ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions ⋮ Fully homomorphic NIZK and NIWI proofs ⋮ A new definition of homomorphic signature for identity management in mobile cloud computing ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Batch verifiable computation of outsourced functions ⋮ Multi-key Homomorphic Authenticators ⋮ Protean Signature Schemes ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ Linearly homomorphic signatures with designated combiner ⋮ An efficient homomorphic aggregate signature scheme based on lattice ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ Algebraic (trapdoor) one-way functions: constructions and applications ⋮ Trusted computing with addition machines. II ⋮ Practical homomorphic message authenticators for arithmetic circuits ⋮ Identity-based quotable ring signature ⋮ Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures ⋮ Efficient digital signatures from RSA without random oracles ⋮ Verifiable pattern matching on outsourced texts ⋮ A more efficient leveled strongly-unforgeable fully homomorphic signature scheme ⋮ Cryptography with Updates ⋮ Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key ⋮ Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ The Geometry of Lattice Cryptography ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ On Constructing Homomorphic Encryption Schemes from Coding Theory ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Computing on authenticated data ⋮ Lattice-based linearly homomorphic signature scheme over binary field
This page was built for publication: Homomorphic Signatures for Polynomial Functions
