Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Kaartik Bhushan, Venkata Koppula, and Manoj Prabhakaran. Homomorphic Indistinguishability Obfuscation and Its Applications. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 14:1-14:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{bhushan_et_al:LIPIcs.ITCS.2024.14, author = {Bhushan, Kaartik and Koppula, Venkata and Prabhakaran, Manoj}, title = {{Homomorphic Indistinguishability Obfuscation and Its Applications}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {14:1--14:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.14}, URN = {urn:nbn:de:0030-drops-195429}, doi = {10.4230/LIPIcs.ITCS.2024.14}, annote = {Keywords: Program Obfuscation, Homomorphisms} }
Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Nico Döttling and Tamer Mour. On the Black-Box Complexity of Correlation Intractability. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 40:1-40:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dottling_et_al:LIPIcs.ITCS.2024.40, author = {D\"{o}ttling, Nico and Mour, Tamer}, title = {{On the Black-Box Complexity of Correlation Intractability}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {40:1--40:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-309-6}, ISSN = {1868-8969}, year = {2024}, volume = {287}, editor = {Guruswami, Venkatesan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.40}, URN = {urn:nbn:de:0030-drops-195683}, doi = {10.4230/LIPIcs.ITCS.2024.40}, annote = {Keywords: Correlation Intractability, Fiat-Shamir, Black-box Complexity, Black-box Separations} }
Published in: LIPIcs, Volume 158, 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)
Zvika Brakerski, Venkata Koppula, Umesh Vazirani, and Thomas Vidick. Simpler Proofs of Quantumness. In 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 158, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{brakerski_et_al:LIPIcs.TQC.2020.8, author = {Brakerski, Zvika and Koppula, Venkata and Vazirani, Umesh and Vidick, Thomas}, title = {{Simpler Proofs of Quantumness}}, booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-146-7}, ISSN = {1868-8969}, year = {2020}, volume = {158}, editor = {Flammia, Steven T.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.8}, URN = {urn:nbn:de:0030-drops-120677}, doi = {10.4230/LIPIcs.TQC.2020.8}, annote = {Keywords: Proof of Quantumness, Random Oracle, Learning with Errors} }
Feedback for Dagstuhl Publishing