Pages that link to "Item:Q3582771"

The following pages link to Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers (Q3582771):

Displaying 50 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) (← links)
• Refereed delegation of computation (Q385709) (← links)
• 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)
• Secure computation without computers (Q517015) (← links)
• Outsourcing computation: the minimal refereed mechanism (Q777972) (← links)
• Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
• Batch verifiable computation of outsourced functions (Q887441) (← links)
• Fine-grained secure computation (Q1631318) (← links)
• Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
• Trusted computing with addition machines. II (Q1745689) (← links)
• Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
• Verifiable pattern matching on outsourced texts (Q1757465) (← links)
• Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
• Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
• How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
• New publicly verifiable computation for batch matrix multiplication (Q2004759) (← links)
• Privacy-preserving verifiable delegation of polynomial and matrix functions (Q2023805) (← links)
• Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
• On subversion-resistant SNARKs (Q2039405) (← links)
• Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures (Q2040024) (← 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)
• Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
• Progressive and efficient verification for digital signatures (Q2096619) (← links)
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA (Q2096633) (← links)
• Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
• LOVE a pairing (Q2146100) (← links)
• Adaptive security of practical garbling schemes (Q2152063) (← links)
• Publicly verifiable database scheme with efficient keyword search (Q2201628) (← links)
• Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
• Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
• On the power of secure two-party computation (Q2303458) (← 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)
• Secure and efficient outsourcing computation on large-scale linear regressions (Q2663473) (← links)
• Privacy-preserving computation in cyber-physical-social systems: a survey of the state-of-the-art and perspectives (Q2663507) (← 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)
• Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations (Q2817469) (← links)
• Secure and Traceable Framework for Data Circulation (Q2817476) (← links)
• Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation (Q2822680) (← links)
• Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
• The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
• Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)