Pages that link to "Item:Q2891498"

The following pages link to How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption (Q2891498):

Displaying 37 items.

• Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
• Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
• Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
• Batch verifiable computation of outsourced functions (Q887441) (← links)
• Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing (Q1701978) (← links)
• Fine-grained searchable encryption in multi-user setting (Q1741938) (← links)
• Trusted computing with addition machines. II (Q1745689) (← links)
• Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
• Publicly verifiable searchable symmetric encryption based on efficient cryptographic components (Q1755999) (← links)
• New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
• Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency (Q2051777) (← links)
• Boosting verifiable computation on encrypted data (Q2055689) (← links)
• Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
• SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
• Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin (Q2188962) (← links)
• Protecting data privacy in publicly verifiable delegation of matrix and polynomial functions (Q2306905) (← links)
• Secure outsourcing of modular exponentiations under single untrusted programme model (Q2403228) (← links)
• Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud (Q2441503) (← links)
• Attribute-based versions of Schnorr and ElGamal (Q2634583) (← links)
• Verifiable inner product computation on outsourced database for authenticated multi-user data sharing (Q2666869) (← links)
• Multi-input Functional Encryption and Its Application in Outsourcing Computation (Q2801771) (← links)
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits (Q2816296) (← links)
• Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
• Proxy Re-encryption with Delegatable Verifiability (Q2817808) (← links)
• Multi-key Homomorphic Authenticators (Q2953787) (← links)
• Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings (Q2953790) (← links)
• Verifiable Computation for Randomized Algorithm (Q3179479) (← links)
• Revocation in Publicly Verifiable Outsourced Computation (Q3454572) (← links)
• Arguments of Proximity (Q3457077) (← links)
• Bilinear Entropy Expansion from the Decisional Linear Assumption (Q3457083) (← links)
• Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
• Confidentiality-Preserving Publicly Verifiable Computation (Q4605653) (← links)
• Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
• No-signaling linear PCPs (Q5915596) (← links)
• No-signaling linear PCPs (Q5925695) (← links)
• Threshold secret sharing with geometric algebras (Q6496087) (← links)