Multi-Client Verifiable Computation with Stronger Security Guarantees
暂无分享,去创建一个
Elaine Shi | Jonathan Katz | Feng-Hao Liu | Hong-Sheng Zhou | S. Dov Gordon | E. Shi | Jonathan Katz | Hong-Sheng Zhou | S. D. Gordon | Feng-Hao Liu
[1] Nir Bitansky,et al. Recursive composition and bootstrapping for SNARKS and proof-carrying data , 2013, STOC '13.
[2] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[3] Mihir Bellare,et al. Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing , 2012, ASIACRYPT.
[4] Ben Riva,et al. Salus: a system for server-aided secure function evaluation , 2012, CCS.
[5] Craig Gentry,et al. Quadratic Span Programs and Succinct NIZKs without PCPs , 2013, IACR Cryptol. ePrint Arch..
[6] Elaine Shi,et al. TRUESET: Nearly Practical Verifiable Set Computations , 2014, IACR Cryptol. ePrint Arch..
[7] Jonathan Katz,et al. Multi-Client Non-interactive Verifiable Computation , 2013, TCC.
[8] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[9] Mariana Raykova,et al. Outsourcing Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..
[10] Amit Sahai,et al. Multi-Input Functional Encryption , 2014, IACR Cryptol. ePrint Arch..
[11] Eli Ben-Sasson,et al. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge , 2013, CRYPTO.
[12] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..
[13] Allison Bishop,et al. Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[14] Amit Sahai,et al. On the (im)possibility of obfuscating programs , 2001, JACM.
[15] Craig Gentry,et al. Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.
[16] Roberto Tamassia,et al. Optimal Verification of Operations on Dynamic Sets , 2011, CRYPTO.
[17] Yuval Ishai,et al. From Secrecy to Soundness: Efficient Verification via Secure Computation , 2010, ICALP.
[18] Vinod Vaikuntanathan,et al. Attribute-based encryption for circuits , 2013, STOC '13.
[19] Rosario Gennaro,et al. Publicly verifiable delegation of large polynomials and matrix computations, with applications , 2012, IACR Cryptol. ePrint Arch..
[20] Vinod Vaikuntanathan,et al. How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..
[21] Yael Tauman Kalai,et al. Reusable garbled circuits and succinct functional encryption , 2013, STOC '13.
[22] Elaine Shi,et al. TRUESET: Faster Verifiable Set Computations , 2014, USENIX Security Symposium.
[23] Ran Canetti,et al. Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.
[24] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[25] Yevgeniy Vahlis,et al. Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..
[26] Michael Backes,et al. Verifiable delegation of computation on outsourced data , 2013, CCS.
[27] Yael Tauman Kalai,et al. How to Run Turing Machines on Encrypted Data , 2013, CRYPTO.
[28] Zvika Brakerski,et al. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP , 2012, CRYPTO.
[29] Elaine Shi,et al. Signatures of Correct Computation , 2013, TCC.
[30] Yael Tauman Kalai,et al. Memory Delegation , 2011, CRYPTO.
[31] Eli Ben-Sasson,et al. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture , 2014, USENIX Security Symposium.
[32] Shafi Goldwasser,et al. Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs , 2011, IACR Cryptol. ePrint Arch..
[33] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[34] Brent Waters,et al. Witness encryption and its applications , 2013, STOC '13.
[35] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[36] Elaine Shi,et al. Privacy-Preserving Aggregation of Time-Series Data , 2011, NDSS.