Limits of Provable Security for Homomorphic Encryption-Reference-Cited by-同舟云学术

Limits of Provable Security for Homomorphic Encryption

Published:2013 Issue: Volume: Page:111-128
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2013
language:
Short-container-title:

Author:

Bogdanov Andrej,Lee Chin Ho

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-40041-4_7

Reference22 articles.

1. Akavia, A., Goldreich, O., Goldwasser, S., Moshkovitz, D.: On basing one-way functions on NP-hardness. In: Proceedings of the 38th ACM Symposium on Theory of Computing (2006)

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the 28th ACM Symposium on Theory of Computing, STOC 1996, pp. 99–108. ACM, New York (1996)

3. Lecture Notes in Computer Science;N. Bhatnagar,2011

4. Brassard, G.: Relativized cryptography. In: Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pp. 383–391 (1979)

5. Bogdanov, A., Trevisan, L.: On wost-case to average-case reductions for NP problems. SIAM J. Comp. 36(4) (2006)

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

1. Combinatorially Homomorphic Encryption;Theory of Cryptography;2023

2. On Worst-Case Learning in Relativized Heuristica;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers;Lecture Notes in Computer Science;2021

4. Structure Versus Hardness Through the Obfuscation Lens;SIAM Journal on Computing;2021-01

5. On Basing One-way Permutations on NP-hard Problems under Quantum Reductions;Quantum;2020-08-27