Published in: LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024)
Ari Karchmer. Distributional PAC-Learning from Nisan’s Natural Proofs. In 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 287, pp. 68:1-68:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{karchmer:LIPIcs.ITCS.2024.68, author = {Karchmer, Ari}, title = {{Distributional PAC-Learning from Nisan’s Natural Proofs}}, booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)}, pages = {68:1--68:23}, 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.68}, URN = {urn:nbn:de:0030-drops-195964}, doi = {10.4230/LIPIcs.ITCS.2024.68}, annote = {Keywords: PAC-learning, average-case complexity, communication complexity, natural proofs} }
Published in: LIPIcs, Volume 251, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023)
Zvika Brakerski, Ran Canetti, and Luowen Qian. On the Computational Hardness Needed for Quantum Cryptography. In 14th Innovations in Theoretical Computer Science Conference (ITCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 251, pp. 24:1-24:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{brakerski_et_al:LIPIcs.ITCS.2023.24, author = {Brakerski, Zvika and Canetti, Ran and Qian, Luowen}, title = {{On the Computational Hardness Needed for Quantum Cryptography}}, booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)}, pages = {24:1--24:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-263-1}, ISSN = {1868-8969}, year = {2023}, volume = {251}, editor = {Tauman Kalai, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.24}, URN = {urn:nbn:de:0030-drops-175278}, doi = {10.4230/LIPIcs.ITCS.2023.24}, annote = {Keywords: quantum cryptography, efi, commitment scheme, oblivious transfer, zero knowledge, secure multiparty computation} }
Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Pierre Civit and Maria Potop-Butucaru. Dynamic Probabilistic Input Output Automata. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{civit_et_al:LIPIcs.DISC.2022.15, author = {Civit, Pierre and Potop-Butucaru, Maria}, title = {{Dynamic Probabilistic Input Output Automata}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.15}, URN = {urn:nbn:de:0030-drops-172064}, doi = {10.4230/LIPIcs.DISC.2022.15}, annote = {Keywords: Automata, Distributed Computing, Formal Verification, Dynamic systems} }
Published in: LIPIcs, Volume 230, 3rd Conference on Information-Theoretic Cryptography (ITC 2022)
Nishanth Chandran, Pouyan Forghani, Juan Garay, Rafail Ostrovsky, Rutvik Patel, and Vassilis Zikas. Universally Composable Almost-Everywhere Secure Computation. In 3rd Conference on Information-Theoretic Cryptography (ITC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 230, pp. 14:1-14:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chandran_et_al:LIPIcs.ITC.2022.14, author = {Chandran, Nishanth and Forghani, Pouyan and Garay, Juan and Ostrovsky, Rafail and Patel, Rutvik and Zikas, Vassilis}, title = {{Universally Composable Almost-Everywhere Secure Computation}}, booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)}, pages = {14:1--14:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-238-9}, ISSN = {1868-8969}, year = {2022}, volume = {230}, editor = {Dachman-Soled, Dana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.14}, URN = {urn:nbn:de:0030-drops-164929}, doi = {10.4230/LIPIcs.ITC.2022.14}, annote = {Keywords: Secure multi-party computation, universal composability, almost-everywhere secure computation, sparse graphs, secure message transmission} }
Published in: LIPIcs, Volume 230, 3rd Conference on Information-Theoretic Cryptography (ITC 2022)
Gilad Asharov, Ran Cohen, and Oren Shochat. Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. In 3rd Conference on Information-Theoretic Cryptography (ITC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 230, pp. 15:1-15:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{asharov_et_al:LIPIcs.ITC.2022.15, author = {Asharov, Gilad and Cohen, Ran and Shochat, Oren}, title = {{Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW}}, booktitle = {3rd Conference on Information-Theoretic Cryptography (ITC 2022)}, pages = {15:1--15:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-238-9}, ISSN = {1868-8969}, year = {2022}, volume = {230}, editor = {Dachman-Soled, Dana}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.15}, URN = {urn:nbn:de:0030-drops-164933}, doi = {10.4230/LIPIcs.ITC.2022.15}, annote = {Keywords: secure multiparty computation, perfect security, adaptive security, BGW protocol} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Jiahui Liu, Qipeng Liu, and Luowen Qian. Beating Classical Impossibility of Position Verification. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 100:1-100:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{liu_et_al:LIPIcs.ITCS.2022.100, author = {Liu, Jiahui and Liu, Qipeng and Qian, Luowen}, title = {{Beating Classical Impossibility of Position Verification}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {100:1--100:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.100}, URN = {urn:nbn:de:0030-drops-156963}, doi = {10.4230/LIPIcs.ITCS.2022.100}, annote = {Keywords: cryptographic protocol, position verification, quantum cryptography, proof of quantumness, non-locality} }
Published in: Dagstuhl Seminar Proceedings, Volume 8491, Theoretical Foundations of Practical Information Security (2009)
Ran Canetti, Shafi Goldwasser, Günter Müller, and Rainer Steinwandt. 08491 Abstracts Collection – Theoretical Foundations of Practical Information Security. In Theoretical Foundations of Practical Information Security. Dagstuhl Seminar Proceedings, Volume 8491, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{canetti_et_al:DagSemProc.08491.1, author = {Canetti, Ran and Goldwasser, Shafi and M\"{u}ller, G\"{u}nter and Steinwandt, Rainer}, title = {{08491 Abstracts Collection – Theoretical Foundations of Practical Information Security}}, booktitle = {Theoretical Foundations of Practical Information Security}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8491}, editor = {Ran Canetti and Shafi Goldwasser and G\"{u}nter M\"{u}ller and Rainer Steinwandt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08491.1}, URN = {urn:nbn:de:0030-drops-18945}, doi = {10.4230/DagSemProc.08491.1}, annote = {Keywords: Organic computing, self-organisation, design, adaptivity} }
Published in: Dagstuhl Seminar Proceedings, Volume 8491, Theoretical Foundations of Practical Information Security (2009)
Ran Canetti, Shafi Goldwasser, Günter Müller, and Rainer Steinwandt. 08491 Executive Summary – Theoretical Foundations of Practical Information Security. In Theoretical Foundations of Practical Information Security. Dagstuhl Seminar Proceedings, Volume 8491, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{canetti_et_al:DagSemProc.08491.2, author = {Canetti, Ran and Goldwasser, Shafi and M\"{u}ller, G\"{u}nter and Steinwandt, Rainer}, title = {{08491 Executive Summary – Theoretical Foundations of Practical Information Security }}, booktitle = {Theoretical Foundations of Practical Information Security}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8491}, editor = {Ran Canetti and Shafi Goldwasser and G\"{u}nter M\"{u}ller and Rainer Steinwandt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08491.2}, URN = {urn:nbn:de:0030-drops-18938}, doi = {10.4230/DagSemProc.08491.2}, annote = {Keywords: Organic computing, self-organisation, design, adaptivity} }
Published in: Dagstuhl Seminar Proceedings, Volume 8491, Theoretical Foundations of Practical Information Security (2009)
Ran Canetti, Ling Cheung, Dilsun Kaynar, Nancy Lynch, and Olivier Pereira. Modeling Computational Security in Long-Lived Systems. In Theoretical Foundations of Practical Information Security. Dagstuhl Seminar Proceedings, Volume 8491, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{canetti_et_al:DagSemProc.08491.3, author = {Canetti, Ran and Cheung, Ling and Kaynar, Dilsun and Lynch, Nancy and Pereira, Olivier}, title = {{Modeling Computational Security in Long-Lived Systems}}, booktitle = {Theoretical Foundations of Practical Information Security}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8491}, editor = {Ran Canetti and Shafi Goldwasser and G\"{u}nter M\"{u}ller and Rainer Steinwandt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08491.3}, URN = {urn:nbn:de:0030-drops-18908}, doi = {10.4230/DagSemProc.08491.3}, annote = {Keywords: Long lived security; universally composable security;} }
Published in: Dagstuhl Seminar Proceedings, Volume 8491, Theoretical Foundations of Practical Information Security (2009)
Chris Peikert. Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. In Theoretical Foundations of Practical Information Security. Dagstuhl Seminar Proceedings, Volume 8491, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{peikert:DagSemProc.08491.4, author = {Peikert, Chris}, title = {{Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem}}, booktitle = {Theoretical Foundations of Practical Information Security}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8491}, editor = {Ran Canetti and Shafi Goldwasser and G\"{u}nter M\"{u}ller and Rainer Steinwandt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08491.4}, URN = {urn:nbn:de:0030-drops-18922}, doi = {10.4230/DagSemProc.08491.4}, annote = {Keywords: Lattice-based cryptography, learning with errors, quantum computation} }
Published in: Dagstuhl Seminar Proceedings, Volume 8491, Theoretical Foundations of Practical Information Security (2009)
Juan Garay, Aggelos Kiayias, and Hong-Sheng Zhou. Sound and Fine-grain Specification of Ideal Functionalities. In Theoretical Foundations of Practical Information Security. Dagstuhl Seminar Proceedings, Volume 8491, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{garay_et_al:DagSemProc.08491.5, author = {Garay, Juan and Kiayias, Aggelos and Zhou, Hong-Sheng}, title = {{Sound and Fine-grain Specification of Ideal Functionalities}}, booktitle = {Theoretical Foundations of Practical Information Security}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {8491}, editor = {Ran Canetti and Shafi Goldwasser and G\"{u}nter M\"{u}ller and Rainer Steinwandt}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08491.5}, URN = {urn:nbn:de:0030-drops-18911}, doi = {10.4230/DagSemProc.08491.5}, annote = {Keywords: Security definitions, universal composability, cryptographic protocols, lattices and partial orders.} }
Feedback for Dagstuhl Publishing