Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing-Reference-Cited by-同舟云学术

Achieving Privacy in Verifiable Computation with Multiple Servers – Without FHE and without Pre-processing

Published:2014 Issue: Volume: Page:149-166
ISSN:0302-9743
Container-title:Public-Key Cryptography – PKC 2014
language:
Short-container-title:

Author:

Ananth Prabhanjan,Chandran Nishanth,Goyal Vipul,Kanukurthi Bhavana,Ostrovsky Rafail

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-54631-0_9

Reference27 articles.

1. Ananth, P., Chandran, N., Goyal, V., Kanukurthi, B., Ostrovsky, R.: Achieving privacy in verifiable computation with multiple servers – without fhe and without pre-processing. IACR Cryptology ePrint Archive (2014)

2. Lecture Notes in Computer Science;B. Applebaum,2010

3. Lecture Notes in Computer Science;M. Blaze,1998

4. Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ITCS 2012, pp. 326–349. ACM, New York (2012)

5. Lecture Notes in Computer Science;S. Benabbas,2011

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Enhancing Privacy Preservation in Verifiable Computation through Random Permutation Masking to Prevent Leakage;Information;2023-11-06

2. Practical reusable garbled circuits with parallel updates;Computer Standards & Interfaces;2023-08

3. Publicly Verifiable Homomorphic Secret Sharing for Polynomial Evaluation;IEEE Transactions on Information Forensics and Security;2023

4. Verifiable Homomorphic Secret Sharing for Machine Learning Classifiers;IEEE Access;2023

5. Privacy-Preserving Large Language Models (PPLLMs);SSRN Electronic Journal;2023