Pages that link to "Item:Q2874515"

The following pages link to Homomorphic Signatures with Efficient Verification for Polynomial Functions (Q2874515):

Displaying 17 items.

• Batch verifiable computation of outsourced functions (Q887441) (← links)
• Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions (Q1671634) (← links)
• Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
• Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) (← links)
• A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
• Progressive and efficient verification for digital signatures (Q2096619) (← links)
• Labeled homomorphic encryption. Scalable and privacy-preserving processing of outsourced data (Q2167714) (← links)
• A compiler for multi-key homomorphic signatures for Turing machines (Q2232614) (← links)
• Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information (Q2817818) (← links)
• Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
• Multi-key Homomorphic Authenticators (Q2953787) (← links)
• On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
• Homomorphic Proxy Re-Authenticators and Applications to Verifiable Multi-User Data Aggregation (Q5854430) (← links)
• Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
• Chainable functional commitments for unbounded-depth circuits (Q6582224) (← links)
• On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions (Q6635746) (← links)
• Fully-succinct multi-key homomorphic signatures from standard assumptions (Q6652902) (← links)