Pages that link to "Item:Q3003381"

The following pages link to Homomorphic Signatures for Polynomial Functions (Q3003381):

Displaying 44 items.

• Lattice-based linearly homomorphic signatures in the standard model (Q284579) (← links)
• A new definition of homomorphic signature for identity management in mobile cloud computing (Q389372) (← links)
• Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
• Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
• Batch verifiable computation of outsourced functions (Q887441) (← links)
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
• An efficient homomorphic aggregate signature scheme based on lattice (Q1718616) (← links)
• Trusted computing with addition machines. II (Q1745689) (← links)
• Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
• Identity-based quotable ring signature (Q1750014) (← links)
• Verifiable pattern matching on outsourced texts (Q1757465) (← links)
• Efficient digital signatures from RSA without random oracles (Q1999174) (← links)
• A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
• Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key (Q2037197) (← links)
• Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
• Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
• A compiler for multi-key homomorphic signatures for Turing machines (Q2232614) (← links)
• A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
• Computing on authenticated data (Q2344052) (← links)
• Linearly homomorphic signatures with designated combiner (Q2697930) (← links)
• Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures (Q2794502) (← links)
• Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information (Q2817818) (← links)
• Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
• Short Transitive Signatures for Directed Trees (Q2889993) (← links)
• Multi-key Homomorphic Authenticators (Q2953787) (← links)
• The Geometry of Lattice Cryptography (Q3092183) (← links)
• On Constructing Homomorphic Encryption Schemes from Coding Theory (Q3104683) (← links)
• On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
• Trapdoors for Ideal Lattices with Applications (Q3454588) (← links)
• Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys (Q3457069) (← links)
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures (Q4916021) (← links)
• Lattice-based linearly homomorphic signature scheme over binary field (Q5018301) (← links)
• Linearly Homomorphic Signatures with Designated Entities (Q5056030) (← links)
• Cryptography with Updates (Q5738983) (← links)
• Linearly Homomorphic Authenticated Encryption with Provable Correctness and Public Verifiability (Q5739031) (← links)
• Watermarking cryptographic functionalities from standard lattice assumptions (Q5918350) (← links)
• Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
• Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
• Chainable functional commitments for unbounded-depth circuits (Q6582224) (← links)
• Towards tightly secure short linearly homomorphic signatures (Q6613999) (← links)
• On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
• Fully-succinct multi-key homomorphic signatures from standard assumptions (Q6652902) (← links)
• Efficient universally-verifiable electronic voting with everlasting privacy (Q6660396) (← links)