Indistinguishability obfuscation from circular security-Reference-Cited by-同舟云学术

Indistinguishability obfuscation from circular security

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Gay Romain¹^ORCID,Pass Rafael²

Affiliation:

1. IBM Research, Switzerland

2. Cornell Tech, USA

Funder

DARPA SIEVE

NSF (National Science Foundation)

JPMorgan Chase and Company

AFOSR

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3406325.3451070

Reference64 articles.

1. Tolga Acar Mira Belenkiy Mihir Bellare and David Cash. 2010. Cryptographic Agility and Its Relation to Circular Encryption. 403–422. 10.1007/978-3-642-13190-5_21 Tolga Acar Mira Belenkiy Mihir Bellare and David Cash. 2010. Cryptographic Agility and Its Relation to Circular Encryption. 403–422. 10.1007/978-3-642-13190-5_21

2. Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation

3. Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE

4. Miklós Ajtai. 1996. Generating Hard Instances of Lattice Problems (Extended Abstract). 99–108. 10.1145/237814.237838 Miklós Ajtai. 1996. Generating Hard Instances of Lattice Problems (Extended Abstract). 99–108. 10.1145/237814.237838

5. Joël Alwen and Chris Peikert. 2009. Generating Shorter Bases for Hard Random Lattices. In 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science) Susanne Albers and Jean-Yves Marion (Eds.). IBFI Schloss Dagstuhl Freiburg Germany 75–86. Joël Alwen and Chris Peikert. 2009. Generating Shorter Bases for Hard Random Lattices. In 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science) Susanne Albers and Jean-Yves Marion (Eds.). IBFI Schloss Dagstuhl Freiburg Germany 75–86.

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

1. Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Generic constructions of master-key KDM secure attribute-based encryption;Designs, Codes and Cryptography;2023-09-09

3. Privacy-preserving cryptographic algorithms and protocols: a survey on designs and applications;SCIENTIA SINICA Informationis;2023-09-01

4. Candidate iO from Homomorphic Encryption Schemes;Journal of Cryptology;2023-06-08

5. Obfuscation of Pseudo-Deterministic Quantum Circuits;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02