Generalizing Homomorphic MACs for Arithmetic Circuits-Reference-Cited by-同舟云学术

Generalizing Homomorphic MACs for Arithmetic Circuits

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

Author:

Catalano Dario,Fiore Dario,Gennaro Rosario,Nizzardo Luca

Publisher

Springer Berlin Heidelberg

Link

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

Reference39 articles.

1. Lecture Notes in Computer Science;S. Agrawal,2009

2. Lecture Notes in Computer Science;N. Attrapadung,2011

3. Lecture Notes in Computer Science;N. Attrapadung,2013

4. Backes, M., Fiore, D., Reischuk, R.M.: Verifiable delegation of computation on outsourced data. In: 2013 ACM Conference on Computer and Communication Security. ACM Press (November 2013)

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

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

1. Verifiable privacy-preserving cox regression from multi-key fully homomorphic encryption;Peer-to-Peer Networking and Applications;2024-06-26

2. Multi-Key Homomorphic MACs with Efficient Verification for Quadratic Arithmetic Circuits;Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security;2022-05-30

3. Multi-Server Verifiable Computation of Low-Degree Polynomials;2022 IEEE Symposium on Security and Privacy (SP);2022-05

4. Practical Verifiable Computation on Encrypted Data;2022 IEEE 8th Intl Conference on Big Data Security on Cloud (BigDataSecurity), IEEE Intl Conference on High Performance and Smart Computing, (HPSC) and IEEE Intl Conference on Intelligent Data and Security (IDS);2022-05

5. Multi-Server Verifiable Computation of Low-Degree Polynomials;P IEEE S SECUR PRIV;2022