Publications - Information Security and Cryptography Research Group

<!DOCTYPE html> <html lang="en"> <head> <meta charset="utf-8"> <meta name="viewport" content="initial-scale=1"> <title>Publications - Information Security and Cryptography Research Group - ETH Zürich</title> <link rel="stylesheet" href="/assets/css/crypto.css"> <link rel="stylesheet" href="/assets/css/menu.css"> <link rel="stylesheet" href="/assets/fontawesome/css/all.min.css"> <link rel="stylesheet" href="/assets/academicons/css/academicons.min.css"> <script src="/assets/js/menu.js"></script> <script src="/assets/mathjax/config.js" defer></script> <script src="/assets/mathjax/tex-chtml.js" defer></script> <link rel="apple-touch-icon" sizes="180x180" href="/assets/favicons/apple-touch-icon.png"> <link rel="icon" type="image/png" sizes="32x32" href="/assets/favicons/favicon-32x32.png"> <link rel="icon" type="image/png" sizes="16x16" href="/assets/favicons/favicon-16x16.png"> <link rel="manifest" href="/assets/favicons/site.webmanifest"> <link rel="mask-icon" href="/assets/favicons/safari-pinned-tab.svg" color="#5bbad5"> <meta name="theme-color" content="#ffffff"> </head> <body> <header> <a href="https://www.ethz.ch/"> <img alt="" src="/assets/images/eth.svg" id="logo-eth"> </a> <h1> <a href="/"> Information Security and Cryptography<span class="optional"> Research Group</span> </a> </h1> </header> <nav id="navbar" class="darkgrey"> <a href="#" onclick="event.preventDefault(); toggle_menu();"> <span id="hamburger"></span> </a> <ul id="menu"> <li> <a href="/">Home</a> </li> <li> <a href="/#teaching" onclick="close_menu();">Teaching</a> <ul class="submenu"> <li> <a href="/teaching/CP25/"> Cryptographic Protocols 2025 </a> </li> <li> <a href="/teaching/Seminar25/"> Current Topics in Cryptography 2025 </a> </li> <li> <a href="/teaching/DM24/"> Diskrete Mathematik 2024 </a> </li> <li> <a href="/teaching/CP24/"> Cryptographic Protocols 2024 </a> </li> <li> <a href="/teaching/DM23/"> Diskrete Mathematik 2023 </a> </li> <li> <a href="/teaching/CP23/"> Cryptographic Protocols 2023 </a> </li> <li> <a href="/teaching/Seminar23/"> Current Topics in Cryptography 2023 </a> </li> <li> <a href="/teaching/madasa/"> Master and Bachelor Theses </a> </li> </ul> </li> <li> <a href="/#people" onclick="close_menu();">People</a> <ul class="submenu"> <li> <a href="/~maurer/"> Ueli Maurer </a> </li> <li> <a href="/~guenthart/"> Claudia Günthart </a> </li> <li> <a href="/~hirt/"> Martin Hirt </a> </li> <li> <a href="/~brian/"> Gianluca Brian </a> </li> <li> <a href="/~nguyen/"> Hai Hoang Nguyen </a> </li> <li> <a href="/~deligios/"> Giovanni Deligios </a> </li> <li> <a href="/~gegier/"> Konstantin Gegier </a> </li> <li> <a href="/~alumni/"> Alumni </a> </li> </ul> </li> <li> <a href="/publications/">Publications</a> </li> <li> <a href="/applications.html">Open Positions</a> </li> </ul> </nav> <div id="wrapper"> <aside> <nav> <ul class="submenu"> <li> <a href="#y2024">2024</a> </li> <li> <a href="#y2023">2023</a> </li> <li> <a href="#y2022">2022</a> </li> <li> <a href="#y2021">2021</a> </li> <li> <a href="#y2020">Older</a> </li> </ul> </nav> </aside> <main> <section id="y2024"> <h2>Publications of 2024</h2> <article class="pubentry"> <h3>Anamorphic Encryption, Revisited</h3> <div class="authors">Fabio Banfi, Konstantin Gegier, Martin Hirt, Ueli Maurer, and Guilherme Rito</div> <div class="venue"> Advances in Cryptology – EUROCRYPT 2024, LNCS, Springer Nature Switzerland, vol. 14652, pp. 3–32, May 2024. </div> <ul class="publinks"> <li> <a href="/publications/files/BGHMR24.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BGHMR24.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2023/249"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-031-58723-8_1"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Closing The Efficiency Gap Between Synchronous and Network-Agnostic Consensus</h3> <div class="authors">Giovanni Deligios and Mose Mizrahi Erbes</div> <div class="venue"> Eurocrypt, May 2024. </div> <ul class="publinks"> <li> <a href="/publications/files/DeEr24.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DeEr24.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2024/317"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v="><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>From Random Probing to Noisy Leakages Without Field-Size Dependence</h3> <div class="authors">Gianluca Brian, Stefan Dziembowski, and Sebastian Faust</div> <div class="venue"> Eurocrypt, May 2024. </div> <ul class="publinks"> <li><a href="/publications/BrDzFa24.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2024/339"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> </section> <section id="y2023"> <h2>Publications of 2023</h2> <article class="pubentry"> <h3>Perfect MPC over Layered Graphs</h3> <div class="authors">Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushileviz, Chen-Da Liu-Zhang, and Varun Narayanan</div> <div class="venue"> Advances in Cryptology—CRYPTO 2023, LNCS, Springer Nature Switzerland, vol. 14081, pp. 360–392, Aug 2023. </div> <ul class="publinks"> <li> <a href="/publications/files/DDGIKKLN23.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DDGIKKLN23.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2023/415"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-031-38557-5 12"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Efficient Synchronization-Light Work Stealing</h3> <div class="authors">Rafael Custódio, Hervé Paulino, and Guilherme Rito</div> <div class="venue"> ACM Symposium on Parallelism in Algorithms and Architectures—SPAA 2023, ACM, pp. 39–49, Jun 2023. </div> <ul class="publinks"> <li> <a href="/publications/files/CusPauRit23.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CusPauRit23.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1145/3558481.3591099"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Deniable Authentication when Signing Keys Leak</h3> <div class="authors">Suvradip Chakraborty, Dennis Hofheinz, Ueli Maurer, Christopher Portmann, and Guilherme Rito</div> <div class="venue"> Advances in Cryptology—EUROCRYPT 2023, Lecture Notes in Computer Science, Springer International Publishing, vol. 14006, pp. 69–100, May 2023. </div> <ul class="publinks"> <li> <a href="/publications/files/CHMR23.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CHMR23.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2023/213"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-031-30620-4_3"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=cx2zAGqsssU"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Synchronous Perfectly Secure Message Transmission with Optimal Asynchronous Fallback Guarantees</h3> <div class="authors">Giovanni Deligios and Chen-Da Liu Zhang</div> <div class="venue"> Financial Cryptography and Data Security, Springer Nature Switzerland, vol. , pp. 77–93, May 2023. </div> <ul class="publinks"> <li> <a href="/publications/files/DeLi23.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DeLi23.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2022/1397"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v="><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Practical Provably Secure Flooding for Blockchains</h3> <div class="authors">Chen-Da Liu-Zhang, Christian Matt, Ueli Maurer, Guilherme Rito, and Søren Eller Thomsen</div> <div class="venue"> Advances in Cryptology—ASIACRYPT 2022, Lecture Notes in Computer Science, Springer International Publishing, vol. 13791, pp. 774–805, Feb 2023. </div> <ul class="publinks"> <li> <a href="/publications/files/LMMRT22.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LMMRT22.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2022/608"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-031-22963-3_26"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=IGWtPVruYLk"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> </section> <section id="y2022"> <h2>Publications of 2022</h2> <article class="pubentry"> <h3>Anonymous Authenticated Communication</h3> <div class="authors">Fabio Banfi and Ueli Maurer</div> <div class="venue"> Security and Cryptography for Networks – SCN 2022, LNCS, Springer, vol. 13409, pp. 289–312, Sep 2022. </div> <ul class="publinks"> <li> <a href="/publications/files/BanMau22.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BanMau22.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2021/1581"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-031-14791-3_13"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Multi-Designated Receiver Signed Public Key Encryption</h3> <div class="authors">Ueli Maurer, Christopher Portmann, and Guilherme Rito</div> <div class="venue"> Advances in Cryptology—EUROCRYPT 2022, Lecture Notes in Computer Science, Springer International Publishing, vol. 13276, pp. 644–673, May 2022. </div> <ul class="publinks"> <li> <a href="/publications/files/MaPoRi22.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MaPoRi22.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2022/256"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-031-07085-3_22"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=F_Q6Am1C9JA"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>SCB Mode: Semantically Secure Length-Preserving Encryption</h3> <div class="authors">Fabio Banfi</div> <div class="venue"> IACR Trans. Symm. Cryptol., Ruhr-Universität Bochum, vol. 2022, no. 4, pp. 1–23, 2022. </div> <ul class="publinks"> <li> <a href="/publications/files/Banfi22.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Banfi22.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2022/1702"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.46586/tosc.v2022.i4.1-23"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=ffBO9felKNA?&t=1478"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> </section> <section id="y2021"> <h2>Publications of 2021</h2> <article class="pubentry"> <h3>Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)</h3> <div class="authors">Ueli Maurer, Christopher Portmann, and Guilherme Rito</div> <div class="venue"> Advances in Cryptology—ASIACRYPT 2021, Lecture Notes in Computer Science, Springer International Publishing, vol. 13092, pp. 189–219, Dec 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/MaPoRi21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MaPoRi21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2021/1185"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-92078-4_7"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=attkT_1DY9Y"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Adaptive Security of Multi-Party Protocols, Revisited</h3> <div class="authors">Martin Hirt, Chen-Da Liu Zhang, and Ueli Maurer</div> <div class="venue"> Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 686–716, Nov 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/HiLiMa21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HiLiMa21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2021/1175"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-90459-3_23"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=-a8mapegk60"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Direct Product Hardness Amplification</h3> <div class="authors">David Lanzenberger and Ueli Maurer</div> <div class="venue"> Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 605–625, Nov 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/LanMau21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LanMau21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2021/1229"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-90453-1_21"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Generalized Proofs of Knowledge with Fully Dynamic Setup</h3> <div class="authors">Christian Badertscher, Daniel Jost, and Ueli Maurer</div> <div class="venue"> Theory of Cryptography – TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 499–528, Nov 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/BJM21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BJM21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2019/662"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-90459-3_17"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>On Communication-Efficient Asynchronous MPC with Adaptive Security</h3> <div class="authors">Annick Chopard, Martin Hirt, and Chen-Da Liu Zhang</div> <div class="venue"> Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13043, pp. 35–65, Nov 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/ChHiLi21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/ChHiLi21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2021/1174"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-90453-1_2"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=7ATRDiLbswI"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback</h3> <div class="authors">Giovanni Deligios, Martin Hirt, and Chen-Da Liu Zhang</div> <div class="venue"> Theory of Cryptography — TCC 2021, LNCS, Springer International Publishing, vol. 13042, pp. 623–653, Nov 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/DeHiLi21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DeHiLi21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2021/1141"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-90459-3_21"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=5tWqdk-fs04"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Scheduling computations with provably low synchronization overheads</h3> <div class="authors">Guilherme Rito and Hervé Paulino</div> <div class="venue"> Journal of Scheduling, Springer International Publishing, Oct 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/RitHer21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/RitHer21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://arxiv.org/abs/1810.10615"><i class="fas fa-external-link-alt"></i> arXiv</a> </li> <li> <a href="https://doi.org/10.1007/s10951-021-00706-6"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Revisiting (R)CCA Security and Replay Protection</h3> <div class="authors">Christian Badertscher, Ueli Maurer, Christopher Portmann, and Guilherme Rito</div> <div class="venue"> Public-Key Cryptography – PKC 2021, Lecture Notes in Computer Science, Springer International Publishing, vol. 12711, pp. 173–202, May 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/BMPR21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMPR21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/177"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-75248-4_7"><i class="fas fa-external-link-alt"></i> DOI</a> </li> <li> <a href="https://youtube.com/watch?v=SvkNaXH6drc"><i class="fas fa-video"></i> YouTube</a> </li> </ul> </article> <article class="pubentry"> <h3>Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL</h3> <div class="authors">David Basin, Andreas Lochbihler, Ueli Maurer, and S. Reza Sefidgar</div> <div class="venue"> Computer Security Foundations Symposium – CSF 2021, pp. 1–16, 2021. </div> <ul class="publinks"> <li> <a href="/publications/files/BLMS21.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BLMS21.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1109/CSF51468.2021.00047"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> </section> <section id="y2020"> <h2>Publications of 2020</h2> <article class="pubentry"> <h3>Asynchronous Byzantine Agreement with Subquadratic Communication</h3> <div class="authors">Erica Blum, Jonathan Katz, Chen-Da Liu Zhang, and Julian Loss</div> <div class="venue"> Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 353–380, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/BKLL20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BKLL20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/851"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-64375-1_13"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Continuous Group Key Agreement with Active Security</h3> <div class="authors">Joël Alwen, Sandro Coretti, Daniel Jost, and Marta Mularczyk</div> <div class="venue"> Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 261–290, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/ACJM20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/ACJM20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/752"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-64378-2_10"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Coupling of Random Systems</h3> <div class="authors">David Lanzenberger and Ueli Maurer</div> <div class="venue"> Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 207–240, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/LanMau20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LanMau20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/1187"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-64381-2_8"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>MPC with Synchronous Security and Asynchronous Responsiveness</h3> <div class="authors">Chen-Da Liu Zhang, Julian Loss, Ueli Maurer, Tal Moran, and Daniel Tschudi</div> <div class="venue"> Advances in Cryptology—ASIACRYPT 2020, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/LLMMT20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LLMMT20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2019/159"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-64840-4_4"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Multi-Threshold Asynchronous Reliable Broadcast and Consensus</h3> <div class="authors">Martin Hirt, Ard Kastrati, and Chen-Da Liu Zhang</div> <div class="venue"> International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/HiKaLi20b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HiKaLi20b.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/958"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.4230/LIPICS.OPODIS.2020.6"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>On Broadcast in Generalized Network and Adversarial Models</h3> <div class="authors">Chen-Da Liu Zhang, Varun Maram, and Ueli Maurer</div> <div class="venue"> International Conference on Principles of Distributed Systems — OPODIS 2020, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/LiMaMa20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LiMaMa20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/1408"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.4230/LIPICS.OPODIS.2020.25"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Synchronous Constructive Cryptography</h3> <div class="authors">Chen-Da Liu Zhang and Ueli Maurer</div> <div class="venue"> Theory of Cryptography — TCC 2020, LNCS, Springer International Publishing, vol. 12552, pp. 439–472, Dec 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/LiuMau20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LiuMau20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/1226"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-64378-2_16"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Brief Announcement: Multi-Threshold Asynchronous Reliable Broadcast and Consensus</h3> <div class="authors">Martin Hirt, Ard Kastrati, and Chen-Da Liu Zhang</div> <div class="venue"> International Symposium on Distributed Computing — DISC 2020, Oct 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/HiKaLi20a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HiKaLi20a.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.4230/LIPICS.DISC.2020.48"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>From Partial to Global Asynchronous Reliable Broadcast</h3> <div class="authors">Diana Ghinea, Martin Hirt, and Chen-Da Liu Zhang</div> <div class="venue"> International Symposium on Distributed Computing — DISC 2020, Oct 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/GhHiLi20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GhHiLi20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/963"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.4230/LIPICS.DISC.2020.29"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Anonymous Symmetric-Key Communication</h3> <div class="authors">Fabio Banfi and Ueli Maurer</div> <div class="venue"> Security and Cryptography for Networks – SCN 2020, LNCS, Springer, vol. 12238, pp. 471–491, Sep 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/BanMau20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BanMau20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/073"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-57990-6_23"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback</h3> <div class="authors">Erica Blum, Chen-Da Liu Zhang, and Julian Loss</div> <div class="venue"> Advances in Cryptology – CRYPTO 2020, LNCS, Springer, vol. 12171, pp. 707–731, Aug 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/BlLiLo20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BlLiLo20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/740"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-56880-1_25"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees</h3> <div class="authors">Daniel Jost and Ueli Maurer</div> <div class="venue"> Advances in Cryptology – CRYPTO 2020, LNCS, Springer, vol. 12170, pp. 33–62, Aug 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/JosMau20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/JosMau20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/092"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-56784-2_2"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Efficient MPC with a Mixed Adversary</h3> <div class="authors">Martin Hirt and Marta Mularczyk</div> <div class="venue"> 1st Conference on Information-Theoretic Cryptography (ITC 2020), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum für Informatik, vol. 163, pp. 3:1–3:23, Jun 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/HirMul20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirMul20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2020/356"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.4230/LIPIcs.ITC.2020.3"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Topology-Hiding Computation for Networks with Unknown Delays</h3> <div class="authors">Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi</div> <div class="venue"> Public-Key Cryptography — PKC 2020, LNCS, Springer, vol. 12111, pp. 215–245, Apr 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/LLMMMT20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LLMMMT20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2019/1211"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-45388-6_8"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>On Generalizations of Composable Security</h3> <div class="authors">Daniel Jost</div> <div class="venue"> PhD Thesis, ETH Zurich, 2020. </div> <ul class="publinks"> <li> <a href="/publications/files/Jost20.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Jost20.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.3929/ethz-b-000417544"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> </section> <section id="y2019"> <h2>Publications of 2019</h2> <article class="pubentry"> <h3>A Unified and Composable Take on Ratcheting</h3> <div class="authors">Daniel Jost, Ueli Maurer, and Marta Mularczyk</div> <div class="venue"> Theory of Cryptography — TCC 2019, LNCS, Springer International Publishing, vol. 11891, pp. 180–210, Dec 2019. </div> <ul class="publinks"> <li> <a href="/publications/files/JoMaMu19b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/JoMaMu19b.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2019/694"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-36033-7_7"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Composable and Finite Computational Security of Quantum Message Transmission</h3> <div class="authors">Fabio Banfi, Ueli Maurer, Christopher Portmann, and Jiamin Zhu</div> <div class="venue"> Theory of Cryptography – TCC 2019, LNCS, Springer, vol. 11891, pp. 282–311, Dec 2019. </div> <ul class="publinks"> <li> <a href="/publications/files/BMPZ19.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMPZ19.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2019/914"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://arxiv.org/abs/1908.03436"><i class="fas fa-external-link-alt"></i> arXiv</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-36030-6_12"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Brief Announcement: Towards Byzantine Broadcast in Generalized Communication and Adversarial Models</h3> <div class="authors">Chen-Da Liu Zhang, Varun Maram, and Ueli Maurer</div> <div class="venue"> International Symposium on Distributed Computing — DISC 2019, Oct 2019. </div> <ul class="publinks"> <li> <a href="/publications/files/LiMaMa19.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LiMaMa19.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.4230/LIPICS.DISC.2019.47"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Formalizing Constructive Cryptography using CryptHOL</h3> <div class="authors">Andreas Lochbihler, S. Reza Sefidgar, David Basin, and Ueli Maurer</div> <div class="venue"> IEEE 32rd Computer Security Foundations Symposium (CSF), IEEE Press, Jun 2019. </div> <ul class="publinks"> <li> <a href="/publications/files/LSBM19.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LSBM19.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1109/CSF.2019.00018"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging</h3> <div class="authors">Daniel Jost, Ueli Maurer, and Marta Mularczyk</div> <div class="venue"> Advances in Cryptology – EUROCRYPT 2019, LNCS, Springer International Publishing, vol. 11476, pp. 159–188, May 2019. </div> <ul class="publinks"> <li> <a href="/publications/files/JoMaMu19a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/JoMaMu19a.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/954"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-17653-2_6"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Per-session Security: Password-based Cryptography Revisited</h3> <div class="authors">Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> Journal of Computer Security, IOS Press, vol. 27, pp. 75–111, 2019. </div> <ul class="publinks"> <li><a href="/publications/DGMT19.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.3233/JCS-181131"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> </section> <section id="y2018"> <h2>Publications of 2018</h2> <article class="pubentry"> <h3>Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio</h3> <div class="authors">Daniel Jost , Ueli Maurer, and João L. Ribeiro</div> <div class="venue"> Theory of Cryptography — TCC 2018, LNCS, Springer International Publishing, vol. 11239, pp. 345–369, Nov 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/JoMaRi18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/JoMaRi18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/1130"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-03807-6_13"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Topology-Hiding Computation Beyond Semi-Honest Adversaries</h3> <div class="authors">Rio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, and Daniel Tschudi</div> <div class="venue"> Theory of Cryptography — TCC, LNCS, Springer International Publishing, vol. 11240, pp. 3–35, Nov 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/LLMMMT18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LLMMMT18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/255"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-030-03810-6_1"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Toward an Algebraic Theory of Systems</h3> <div class="authors">Christian Matt, Ueli Maurer, Christopher Portmann, Renato Renner, and Björn Tackmann</div> <div class="venue"> Theoretical Computer Science, vol. 747, pp. 1–25, Nov 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/MMPRT18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MMPRT18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://arxiv.org/abs/1609.04293"><i class="fas fa-external-link-alt"></i> arXiv</a> </li> <li> <a href="https://doi.org/10.1016/j.tcs.2018.06.001"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>A Constructive Perspective on Signcryption Security</h3> <div class="authors">Christian Badertscher, Fabio Banfi, and Ueli Maurer</div> <div class="venue"> Security and Cryptography for Networks – SCN 2018, LNCS, Springer, vol. 11035, pp. 102–120, Sep 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/BBM18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BBM18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/050"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-98113-0_6"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Security Definitions For Hash Functions: Combining UCE and Indifferentiability</h3> <div class="authors">Daniel Jost and Ueli Maurer</div> <div class="venue"> International Conference on Security and Cryptography for Networks – SCN 2018, LNCS, Springer, vol. 11035, pp. 83–101, Sep 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/JosMau18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/JosMau18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/461"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-98113-0_5"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>But Why does it Work? A Rational Protocol Design Treatment of Bitcoin</h3> <div class="authors">Christian Badertscher, Juan Garay, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2018, LNCS, Springer, vol. 10821 (Proceedings Part II), pp. 34–65, Apr 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/BGMTZ17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BGMTZ17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/138"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-78375-8_2"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Composable and Robust Outsourced Storage</h3> <div class="authors">Christian Badertscher and Ueli Maurer</div> <div class="venue"> Topics in Cryptology — CT-RSA 2018, LNCS, Springer, vol. 10808, pp. 354-373, Apr 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/BM18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BM18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/133"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-76953-0_19"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>On Composable Security for Digital Signatures</h3> <div class="authors">Christian Badertscher, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> Public-Key Cryptography — PKC 2018, LNCS, Springer, vol. 10769 (Proceedings Part I), pp. 494–523, Mar 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/BMT18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMT18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/015"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-76578-5_17"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>An End-to-End System for Large Scale P2P MPC-as-a-Service and Low-Bandwidth MPC for Weak Participants</h3> <div class="authors">Assi Barak, Martin Hirt, Lior Koskas, and Yehuda Lindell</div> <div class="venue"> Computer and Communications Security — CCS 2018", 2018. </div> <ul class="publinks"> <li><a href="/publications/BHKL18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/751"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1145/3243734.3243801"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>CRYSTALS – Kyber: a CCA-secure module-lattice-based KEM</h3> <div class="authors">Joppe Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, Gregor Seiler, and Damien Stehlé</div> <div class="venue"> 2018 IEEE European Symposium on Security and Privacy (EuroS&P), IEEE, pp. 353-367, 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/BDKLL18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BDKLL18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/634"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1109/EuroSP.2018.00032"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme</h3> <div class="authors">Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehlé</div> <div class="venue"> IACR Transactions on Cryptographic Hardware and Embedded Systems (TCHES), vol. 2018, no. 1, pp. 238-268, 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/DKLLSS18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DKLLSS18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/633"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.13154/tches.v2018.i1.238-268"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography</h3> <div class="authors">Gregor Seiler</div> <div class="venue"> Cryptology ePrint Archive, 2018, Report 2018/039. </div> <ul class="publinks"> <li> <a href="/publications/files/Seiler18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Seiler18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/039"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> </ul> </article> <article class="pubentry"> <h3>Idealizations of Practical Cryptographic Building Blocks</h3> <div class="authors">Christian Badertscher</div> <div class="venue"> PhD Thesis, ETH Zurich, 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/Badi18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Badi18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.3929/ethz-b-000311730"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Lattice-Based Group Signatures and Zero-Knowledge Proofs of Automorphism Stability</h3> <div class="authors">Rafael del Pino, Vadim Lyubashevsky, and Gregor Seiler</div> <div class="venue"> CCS '18: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, ACM, pp. 574-591, 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/DLS18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DLS18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/779"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1145/3243734.3243852"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability</h3> <div class="authors">Christian Badertscher, Peter Gaži, Aggelos Kiayias, Alexander Russell, and Vassilis Zikas</div> <div class="venue"> The 25th ACM Conference on Computer and Communications Security, 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/BGKRZ18.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BGKRZ18.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2018/378"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1145/3243734.3243848"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Short, Invertible Elements in Partially Splitting Cyclotomic Rings and Applications to Lattice-Based Zero-Knowledge Proofs</h3> <div class="authors">Vadim Lyubashevsky and Gregor Seiler</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2018, Springer, pp. 204-224, 2018. </div> <ul class="publinks"> <li> <a href="/publications/files/LyuSei17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LyuSei17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/523"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-78381-9_8"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> </section> <section id="y2017"> <h2>Publications of 2017</h2> <article class="pubentry"> <h3>Strengthening Access Control Encryption</h3> <div class="authors">Christian Badertscher, Christian Matt, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology—ASIACRYPT 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10624, pp. 502–532, Nov 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/BMM17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMM17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/429"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-70694-8_18"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Per-session Security: Password-based Cryptography Revisited</h3> <div class="authors">Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> Computer Security – ESORICS 2017, Lecture Notes in Computer Science, Springer International Publishing, vol. 10492, pp. 408–426, Sep 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/DGMT17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DGMT17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2016/166"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-66402-6_24"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Bitcoin as a Transaction Ledger: A Composable Treatment</h3> <div class="authors">Christian Badertscher, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology – CRYPTO 2017, LNCS, Springer, vol. 10401 (Proceedings Part I), pp. 324–356, Aug 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/BMTZ17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMTZ17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://eprint.iacr.org/2017/149"><i class="fas fa-external-link-alt"></i> ePrint</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-63688-7_11"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>An Information-theoretic Approach to Hardness Amplification</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> 2017 IEEE International Symposium on Information Theory (ISIT), Jun 2017. </div> <ul class="publinks"> <li><a href="/publications/Maurer17a.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1109/ISIT.2017.8006668"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Efficiency Lower Bounds for Commit-and-Prove Constructions</h3> <div class="authors">Christian Badertscher, Sandro Coretti, Chen-Da Liu Zhang, and Ueli Maurer</div> <div class="venue"> 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 1788–1792, Jun 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/BCLM17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BCLM17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1109/ISIT.2017.8006837"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Witness-Hiding Proofs of Knowledge for Cable Locks</h3> <div class="authors">Chen-Da Liu Zhang, Ueli Maurer, Martin Raszyk, and Daniel Tschudi</div> <div class="venue"> IEEE International Symposium on Information Theory (ISIT), pp. 953-957, Jun 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/LMRT17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LMRT17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1109/ISIT.2017.8006669"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>(Quantum) Min-Entropy Resources</h3> <div class="authors">Christopher Portmann</div> <div class="venue"> Eprint arXiv:1705.10595, May 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/Por17b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Por17b.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://arxiv.org/abs/1705.10595"><i class="fas fa-external-link-alt"></i> arXiv</a> </li> </ul> </article> <article class="pubentry"> <h3>Causal Boxes: Quantum Information-Processing Systems Closed Under Composition</h3> <div class="authors">Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, and Björn Tackmann</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 63, no. 5, pp. 3277-3305, May 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/PMMRT17.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/PMMRT17.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://arxiv.org/abs/1512.02240"><i class="fas fa-external-link-alt"></i> arXiv</a> </li> <li> <a href="https://doi.org/10.1109/TIT.2017.2676805"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Quantum Authentication with Key Recycling</h3> <div class="authors">Christopher Portmann</div> <div class="venue"> Advances in Cryptology – EUROCRYPT 2017, Proceedings, Part III, Lecture Notes in Computer Science, Springer, vol. 10212, pp. 339–368, Apr 2017. </div> <ul class="publinks"> <li> <a href="/publications/files/Por17a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Por17a.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://arxiv.org/abs/1610.03422"><i class="fas fa-external-link-alt"></i> arXiv</a> </li> <li> <a href="https://doi.org/10.1007/978-3-319-56617-7_12"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> </section> <section id="y2016"> <h2>Publications of 2016</h2> <article class="pubentry"> <h3>From Indifferentiability to Constructive Cryptography (and Back)</h3> <div class="authors">Ueli Maurer and Renato Renner</div> <div class="venue"> Theory of Cryptography, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9985, pp. 1–22, Nov 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/MauRen16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauRen16.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Memory Erasability Amplification</h3> <div class="authors">Jan Camenisch, Robert R. Enderlein, and Ueli Maurer</div> <div class="venue"> Security and Cryptography for Networks (SCN), Lecture Notes in Computer Science, Springer, vol. 9841, pp. 104–125, Aug 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/CaEnMa16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CaEnMa16.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Network-Hiding Communication and Applications to Multi-Party Protocols</h3> <div class="authors">Martin Hirt, Ueli Maurer, Daniel Tschudi, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology – CRYPTO 2016, Security and Cryptology, Springer-Verlag Berlin Heidelberg, vol. 9814, pp. 335-365, Aug 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/HMTZ16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HMTZ16.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Hierarchy of Three-Party Consistency Specifications</h3> <div class="authors">Julian Loss, Ueli Maurer, and Daniel Tschudi</div> <div class="venue"> 2016 IEEE International Symposium on Information Theory (ISIT), IEEE, pp. 3048-3052, Jul 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/LoMaTs16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LoMaTs16.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>New Perspectives on Weak Oblivious Transfer</h3> <div class="authors">Ueli Maurer and João Ribeiro</div> <div class="venue"> 2016 IEEE International Symposium on Information Theory (ISIT), pp. 790–794, Jul 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/MauRib16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauRib16.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Impossibility of Information-Theoretic Composable Coin Toss Extension</h3> <div class="authors">Gregor Seiler and Ueli Maurer</div> <div class="venue"> 2016 IEEE International Symposium on Information Theory, pp. 3058–3061, Jul 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/SeiMau16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/SeiMau16.html"><i class="far fa-list-alt"></i> Details</a></li> <li> <a href="https://doi.org/10.1109/ISIT.2016.7541861"><i class="fas fa-external-link-alt"></i> DOI</a> </li> </ul> </article> <article class="pubentry"> <h3>Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions</h3> <div class="authors">Sandro Coretti, Juan Garay, Martin Hirt, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2016, Lecture Notes in Computer Science, Springer-Verlag, vol. 10032, 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/CGHZ16.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CGHZ16.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cryptography and Computation after Turing</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> The Once and Future Turing, Cambridge University Press, 2016. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer16b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer16b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2015"> <h2>Publications of 2015</h2> <article class="pubentry"> <h3>Robust Authenticated Encryption and the Limits of Symmetric Cryptography</h3> <div class="authors">Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, and Björn Tackmann</div> <div class="venue"> 15th IMA International Conference on Cryptography and Coding - IMACC 2015, LNCS, Springer, vol. 9496, pp. 112–129, Dec 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/BMMRT15b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMMRT15b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer</h3> <div class="authors">Christian Badertscher, Christian Matt, Ueli Maurer, Phillip Rogaway, and Björn Tackmann</div> <div class="venue"> The 9th International Conference on Provable Security - ProvSec 2015, LNCS, Springer, vol. 9451, pp. 85–104, Nov 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/BMMRT15a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BMMRT15a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting</h3> <div class="authors">Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology – CRYPTO 2015, LNCS, Springer, vol. 9216, pp. 763-780, Aug 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/AOZZ15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AOZZ15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Definitional Framework for Functional Encryption</h3> <div class="authors">Christian Matt and Ueli Maurer</div> <div class="venue"> Computer Security Foundations Symposium (CSF), 2015 IEEE 28th, pp. 217-231, Jul 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/MatMau15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MatMau15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>How Fair is Your Protocol? A Utility-based Approach to Protocol Optimality</h3> <div class="authors">Juan Garay, Jonathan Katz, Björn Tackmann, and Vassilis Zikas</div> <div class="venue"> ACM Symposium on Principles of Distributed Computing — PODC 2015, ACM, pp. 281-290, Jul 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/GKTZ15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GKTZ15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Query-Complexity Amplification for Random Oracles</h3> <div class="authors">Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> Information Theoretic Security, Lecture Notes in Computer Science, Springer International Publishing, vol. 9063, pp. 159-180, May 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/DGMT15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DGMT15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Hidden Communication Graph Model: Achieving Communication Locality and Optimal Resilience in the Presence of Adaptive Faults</h3> <div class="authors">Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, and Vassilis Zikas</div> <div class="venue"> Innovations in Theoretical Computer Science — ITCS 2015, ACM, pp. 153-162, Jan 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/CCGGOZ15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CCGGOZ15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes</h3> <div class="authors">Sandro Coretti, Ueli Maurer, Björn Tackmann, and Daniele Venturi</div> <div class="venue"> Theory of Cryptography, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9014, pp. 532-560, 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/CMTV15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CMTV15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Idealizing Identity-Based Encryption</h3> <div class="authors">Dennis Hofheinz, Christian Matt, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology – ASIACRYPT 2015, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9452, pp. 495-520, 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/HoMaMa15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HoMaMa15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions</h3> <div class="authors">Jan Camenisch, Robert R. Enderlein, and Gregory Neven</div> <div class="venue"> Public-Key Cryptography – PKC 2015, Lecture Notes in Computer Science, Springer Berlin Heidelberg, vol. 9020, pp. 283–307, 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/CaEnNe15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaEnNe15.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaEnNe15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Zero-knowledge proofs of knowledge for group homomorphisms</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Designs, Codes and Cryptography, vol. 77, pp. 663–676, 2015. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer15.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer15.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2014"> <h2>Publications of 2014</h2> <article class="pubentry"> <h3>Multi-Valued Byzantine Broadcast: the $t < n$ Case</h3> <div class="authors">Martin Hirt and Pavel Raykov</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2014, Lecture Notes in Computer Science, Springer, vol. 8874, pp. 448–465, Dec 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/HirRay14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirRay14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Anonymous Authentication with Shared Secrets</h3> <div class="authors">Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov</div> <div class="venue"> Progress in Cryptology — LATINCRYPT 2014, Sep 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/AHMPR14b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AHMPR14b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Key-Indistinguishable Message Authentication Codes</h3> <div class="authors">Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, and Pavel Raykov</div> <div class="venue"> The 9th Conference on Security and Cryptography for Networks — SCN 2014, Lecture Notes in Computer Science, Springer, vol. 8642, pp. 476–493, Sep 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/AHMPR14a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AHMPR14a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Three-Party Computation from Cut-and-Choose</h3> <div class="authors">Seung Geol Choi, Jonathan Katz, Alex J. Malozemoff, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — CRYPTO 2014, Lecture Notes in Computer Science, Springer-Verlag, vol. 8617, pp. 513-530, Aug 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/CKMZ14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CKMZ14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secure Multi-Party Computation with Identifiable Abort</h3> <div class="authors">Yuval Ishai, Rafail Ostrovsky, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — CRYPTO 2014, Lecture Notes in Computer Science, Springer-Verlag, vol. 8617, pp. 369-386, Aug 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/IsOsZi14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/IsOsZi14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Distributing the Setup in Universally Composable Multi-Party Computation</h3> <div class="authors">Jonathan Katz, Aggelos Kiayias, Hong-Sheng Zhou, and Vassilis Zikas</div> <div class="venue"> ACM Symposium on Principles of Distributed Computing – PODC 2014, Jul 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/KKZZ14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KKZZ14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Fast and Unconditionally Secure Anonymous Channel</h3> <div class="authors">Juan Garay, Clint Givens, Rafail Ostrovsky, and Pavel Raykov</div> <div class="venue"> Proc. 33rd ACM Symposium on Principles of Distributed Computing — PODC 2014, ACM, pp. 313–321, Jul 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/GGOR14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GGOR14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Optimality of Non-Adaptive Strategies: The Case of Parallel Games</h3> <div class="authors">Grégory Demay, Peter Gaži, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> 2014 IEEE International Symposium on Information Theory (ISIT), pp. 1707-1711, Jun 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/DGMT14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DGMT14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Broadcast Amplification</h3> <div class="authors">Martin Hirt, Ueli Maurer, and Pavel Raykov</div> <div class="venue"> Theory of Cryptography Conference — TCC 2014, Lecture Notes in Computer Science, Springer, vol. 8349, pp. 419–439, Feb 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/HiMaRa14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HiMaRa14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Concepts and Languages for Privacy-Preserving Attribute-Based Authentication</h3> <div class="authors">Jan Camenisch, Maria Dubovitskaya, Robert R. Enderlein, Anja Lehmann, Gregory Neven, Christian Paquin, and Franz-Stefan Preiss</div> <div class="venue"> Journal of Information Security and Applications, vol. 19, no. 1, pp. 25–44, Feb 2014. </div> <ul class="publinks"> <li> <a href="/publications/files/CDELNP14.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CDELNP14.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CDELNP14.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2013"> <h2>Publications of 2013</h2> <article class="pubentry"> <h3>Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited</h3> <div class="authors">Sandro Coretti, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> Advances in Cryptology—ASIACRYPT 2013, Lecture Notes in Computer Science, Springer, vol. 8269, pp. 134–153, Dec 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/CoMaTa13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CoMaTa13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient General-Adversary Multi-Party Computation</h3> <div class="authors">Martin Hirt and Daniel Tschudi</div> <div class="venue"> Advances in Cryptology—ASIACRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8270, pp. 181-200, Dec 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/HirTsc13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirTsc13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Broadcast (and Round) Efficient Verifiable Secret Sharing</h3> <div class="authors">Juan Garay, Clint Givens, Rafail Ostrovsky, and Pavel Raykov</div> <div class="venue"> The 7th International Conference on Information Theoretic Security — ICITS 2013, Lecture Notes in Computer Science, Springer, vol. 8317, pp. 200–219, Nov 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/GGOR13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GGOR13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Rational Protocol Design: Cryptography Against Incentive-driven Adversaries</h3> <div class="authors">Juan Garay, Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas</div> <div class="venue"> FOCS 2013, IEEE, Oct 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/GKMTZ13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GKMTZ13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party Computation</h3> <div class="authors">Martin Hirt, Christoph Lucas, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8043, pp. 203–219, Aug 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/HiLuMa13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HiLuMa13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Learning with Rounding, Revisited: New Reduction, Properties and Applications</h3> <div class="authors">Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, and Daniel Wichs</div> <div class="venue"> Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, Aug 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/AKPW13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AKPW13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers</h3> <div class="authors">Peter Gaži</div> <div class="venue"> Advances in Cryptology — CRYPTO 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 8042, pp. 551–570, Aug 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/Gazi13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Gazi13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Anonymity-preserving Public-Key Encryption: A Constructive Approach</h3> <div class="authors">Markulf Kohlweiss, Ueli Maurer, Cristina Onete, Björn Tackmann, and Daniele Venturi</div> <div class="venue"> Privacy Enhancing Technologies — 13th International Symposium, Lecture Notes in Computer Science, Springer, vol. 7981, pp. 19–39, Jul 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/KMOTV13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KMOTV13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Authentication Amplification by Synchronization</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2711–2714, Jul 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer13a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer13a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Conditional Equivalence of Random Systems and Indistinguishability Proofs</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 3150–3154, Jul 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer13b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer13b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Complexity of Broadcast Setup</h3> <div class="authors">Martin Hirt and Pavel Raykov</div> <div class="venue"> Automata, Languages, and Programming — 40th International Colloquium, ICALP (1), Lecture Notes in Computer Science, Springer, vol. 7965, pp. 552–563, Jul 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/HirRay13a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirRay13a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The One-Time Pad Revisited</h3> <div class="authors">Christian Matt and Ueli Maurer</div> <div class="venue"> Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, pp. 2706-2710, Jul 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/MatMau13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MatMau13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unfair Coin Tossing</h3> <div class="authors">Grégory Demay and Ueli Maurer</div> <div class="venue"> 2013 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1556–1560, Jul 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/DemMau13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DemMau13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Resource-Restricted Indifferentiability</h3> <div class="authors">Grégory Demay, Peter Gaži, Martin Hirt, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7881, pp. 665–684, May 2013, this is the full version. </div> <ul class="publinks"> <li> <a href="/publications/files/DGHM13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DGHM13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Feasibility and Completeness of Cryptographic Tasks in the Quantum World</h3> <div class="authors">Jonathan Katz, Serge Fehr, Fang Song, Hong-Sheng Zhou, and Vassilis Zikas</div> <div class="venue"> Theory of Cryptography Conference — TCC 2013, Lecture Notes in Computer Science, Springer-Verlag, vol. 7785, pp. 281-296, Mar 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/KFSZZ13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KFSZZ13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Universally Composable Synchronous Computation</h3> <div class="authors">Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas</div> <div class="venue"> Theory of Cryptography — TCC 2013, Lecture Notes in Computer Science, Springer, vol. 7785, pp. 477-498, Mar 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/KMTZ13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KMTZ13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Constructive Perspective on Key Encapsulation</h3> <div class="authors">Sandro Coretti, Ueli Maurer, and Björn Tackmann</div> <div class="venue"> Number Theory and Cryptography, Lecture Notes in Computer Science, Springer, vol. 8260, pp. 226–239, 2013. </div> <ul class="publinks"> <li><a href="/publications/CoMaTa13b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Practical and Employable Protocols for UC-Secure Circuit Evaluation over Zn</h3> <div class="authors">Jan Camenisch, Robert R. Enderlein, and Victor Shoup</div> <div class="venue"> Computer Security - ESORICS 2013 - 18th European Symposium on Research in Computer Security, Lecture Notes in Computer Science, Springer, vol. 8134, pp. 19–37, 2013. </div> <ul class="publinks"> <li> <a href="/publications/files/CaEnSh13.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaEnSh13.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaEnSh13.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2012"> <h2>Publications of 2012</h2> <article class="pubentry"> <h3>UOWHFs from OWFs: Trading regularity for efficiency</h3> <div class="authors">Kfir Barhum and Ueli Maurer</div> <div class="venue"> Progress in Cryptology — LATINCRYPT 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7533, pp. 234–253, Oct 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/BarMau12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BarMau12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Common Randomness Amplification: A Constructive View</h3> <div class="authors">Grégory Demay and Ueli Maurer</div> <div class="venue"> IEEE Information Theory Workshop (ITW), pp. 35 -39, Sep 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/DemMau12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DemMau12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Collusion-Preserving Computation</h3> <div class="authors">Joël Alwen, Jonathan Katz, Ueli Maurer, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — CRYPTO 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7417, pp. 124-143, Aug 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/AKMZ12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AKMZ12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Synchrony Amplification</h3> <div class="authors">Ueli Maurer and Björn Tackmann</div> <div class="venue"> Information Theory Proceedings — ISIT 2012, IEEE, pp. 1583-1587, Jul 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/MauTac12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauTac12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading</h3> <div class="authors">Peter Gaži and Stefano Tessaro</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2012, Lecture Notes in Computer Science, Springer-Verlag, vol. 7237, pp. 63–80, Apr 2012, this is the full version. </div> <ul class="publinks"> <li> <a href="/publications/files/GazTes12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GazTes12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Confidentiality and Integrity: A Constructive Perspective</h3> <div class="authors">Ueli Maurer, Andreas Rüedlinger, and Björn Tackmann</div> <div class="venue"> Theory of Cryptography — TCC 2012, Lecture Notes in Computer Science, Springer, vol. 7194, pp. 209–229, Mar 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/MaRuTa12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MaRuTa12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Improved hardness results for unique shortest vector problem</h3> <div class="authors">Divesh Aggarwal and Chandan Dubey</div> <div class="venue"> In submission, 2012. </div> <ul class="publinks"> <li><a href="/publications/AggDub12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>New Preimage Attacks Against Reduced SHA-1</h3> <div class="authors">Simon Knellwolf and Dmitry Khovratovich</div> <div class="venue"> CRYPTO, Lecture Notes in Computer Science, Springer, vol. 7417, pp. 367-383, 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/KneKho12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KneKho12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption</h3> <div class="authors">Jan Camenisch, Maria Dubovitskaya, Robert R. Enderlein, and Gregory Neven</div> <div class="venue"> Security and Cryptography for Networks - 8th International Conference, Lecture Notes in Computer Science, Springer, vol. 7485, pp. 559–579, 2012. </div> <ul class="publinks"> <li> <a href="/publications/files/CDEN12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CDEN12.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CDEN12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Passive Corruption in Statistical Multi-Party Computation</h3> <div class="authors">Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub</div> <div class="venue"> The 6th International Conference on Information Theoretic Security - ICITS 2012, Lecture Notes in Computer Science, Springer-Verlag, 2012, Full Version available from <a href="http://eprint.iacr.org/2012/272">http://eprint.iacr.org/2012/272</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/HLMR12.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HLMR12.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2011"> <h2>Publications of 2011</h2> <article class="pubentry"> <h3>Byzantine Fault-Tolerance with Commutative Commands</h3> <div class="authors">Pavel Raykov, Nicolas Schiper, and Fernando Pedone</div> <div class="venue"> Principles of Distributed Systems — OPODIS 2011, Lecture Notes in Computer Science, Springer, vol. 7109, pp. 329–342, Dec 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/RaScPe11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RaScPe11.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RaScPe11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Privacy-Preserving Outsourcing of Brute-Force Key Searches</h3> <div class="authors">Ghassan O. Karame, Srdjan Capkun, and Ueli Maurer</div> <div class="venue"> Proc. 2011 ACM Cloud Computing Security Workshop (CCSW), ACM, Oct 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/KaCaMa11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KaCaMa11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Nonlocality is Transitive</h3> <div class="authors">Sandro Coretti, Esther Hänggi, and Stefan Wolf</div> <div class="venue"> Phys. Rev. Lett., American Physical Society, vol. 107, pp. 100402, Aug 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/CoHaWo11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CoHaWo11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Player-Centric Byzantine Agreement</h3> <div class="authors">Martin Hirt and Vassilis Zikas</div> <div class="venue"> Automata, Languages and Programming — 38th International Colloquium, ICALP 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6755, pp. 281–292, Jul 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/HirZik11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirZik11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Equivalence of Strong RSA and Factoring in the Generic Ring Model of Computation.</h3> <div class="authors">Divesh Aggarwal, Ueli Maurer, and Igor Shparlinski</div> <div class="venue"> Workshop on Coding and Cryptography - WCC 2011, INRIA, vol. inria00607256, version 1, Jul 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/AgMaSh11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AgMaSh11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Constructive cryptography – A new paradigm for security definitions and proofs</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Theory of Security and Applications (TOSCA 2011), Lecture Notes in Computer Science, Springer-Verlag, vol. 6993, pp. 33–56, Apr 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma</h3> <div class="authors">Stefano Tessaro</div> <div class="venue"> Theory of Cryptography — TCC 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6597, pp. 37–54, Mar 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/Tessar11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Tessar11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Abstract Cryptography</h3> <div class="authors">Ueli Maurer and Renato Renner</div> <div class="venue"> The Second Symposium on Innovations in Computer Science, ICS 2011, Tsinghua University Press, pp. 1–21, Jan 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/MauRen11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauRen11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience</h3> <div class="authors">Arpita Patra and C. Pandu Rangan</div> <div class="venue"> ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 206-226, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/PatRan11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/PatRan11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Computational Verifiable Secret Sharing Revisited</h3> <div class="authors">Michael Backes, Aniket Kate, Arpita Patra</div> <div class="venue"> ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 7073, pp. 590-609, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/BaKaPa11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BaKaPa11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Conditional Differential Cryptanalysis of Trivium and KATAN</h3> <div class="authors">Simon Knellwolf, Willi Meier, and María Naya-Plasencia</div> <div class="venue"> Selected Areas in Cryptography, Lecture Notes in Computer Science, Springer, vol. 7118, pp. 200-212, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/KnMePl11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KnMePl11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cryptanalysis of the Knapsack Generator</h3> <div class="authors">Simon Knellwolf and Willi Meier</div> <div class="venue"> FSE, Lecture Notes in Computer Science, Springer, vol. 6733, pp. 188-198, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/KneMei11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KneMei11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity</h3> <div class="authors">Arpita Patra</div> <div class="venue"> OPODIS, Lecture Notes in Computer Science, Springer, vol. 7109, pp. 34-49, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/Patra11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Patra11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generating Shorter Bases for Hard Random Lattices</h3> <div class="authors">Joël Alwen and Chris Peikert</div> <div class="venue"> Theory Comput. Syst., vol. 48, no. 3, pp. 535-553, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/AP11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AP11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Graceful Degradation in Multi-Party Computation</h3> <div class="authors">Martin Hirt, Christoph Lucas, Ueli Maurer, and Dominik Raub</div> <div class="venue"> The 5th International Conference on Information Theoretic Security - ICITS 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 6673, pp. 163–180, 2011, Full Version available from <a href="http://eprint.iacr.org/2011/094">http://eprint.iacr.org/2011/094</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/HLMR11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HLMR11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secure message transmission in asynchronous networks</h3> <div class="authors">Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, and C. Pandu Rangan</div> <div class="venue"> J. Parallel Distrib. Comput., vol. 71, no. 8, pp. 1067-1074, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/CPVKR11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CPVKR11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.</h3> <div class="authors">Ashish Choudhury, Kaoru Kurosawa, Arpita Patra</div> <div class="venue"> ACNS, Lecture Notes in Computer Science, vol. 6715, pp. 292-308, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/ChKuPa11a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/ChKuPa11a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Leakage-Resilience Limit of a Computational Problem is Equal to its Unpredictability Entropy</h3> <div class="authors">Divesh Aggarwal and Ueli Maurer</div> <div class="venue"> Advances in Cryptology - Asiacrypt 2011, Lecture Notes in Computer Science, Springer-Verlag, vol. 7073, pp. 686-701, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/AggMau11.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AggMau11.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Round Complexity of Perfectly Secure General VSS</h3> <div class="authors">Ashish Choudhury, Kaoru Kurosawa, Arpita Patra</div> <div class="venue"> ICITS, Lecture Notes in Computer Science, Springer, vol. 6673, pp. 143-162, 2011. </div> <ul class="publinks"> <li> <a href="/publications/files/ChKuPa11b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/ChKuPa11b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2010"> <h2>Publications of 2010</h2> <article class="pubentry"> <h3>Random Oracles With(out) Programmability</h3> <div class="authors">Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, and Stefano Tessaro</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6477, pp. 303–320, Dec 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/FLRSST10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/FLRSST10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Soundness of Authenticate-then-Encrypt: Formalizing the Malleability of Symmetric Encryption</h3> <div class="authors">Ueli Maurer and Björn Tackmann</div> <div class="venue"> Proceedings of the 17th ACM Conference on Computer and Communication Security, ACM, pp. 505–515, Oct 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/MauTac10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauTac10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Optimality of LDGM-LDPC Compound Codes for Lossy Compression of Binary Erasure Source</h3> <div class="authors">Grégory Demay, Vishwambhar Rathi, and Lars K. Rasmussen</div> <div class="venue"> Proceedings of the International Symposium on Information Theory and its Applications, Oct 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/DeRaRa10b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DeRaRa10b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Public-Key Encryption in the Bounded-Retrieval Model</h3> <div class="authors">Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, and Daniel Wichs</div> <div class="venue"> Advances in Cryptology - EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 113-134, Aug 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/ADNSWW10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/ADNSWW10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Hybrid-Secure MPC: Trading Information-Theoretic Robustness for Computational Privacy</h3> <div class="authors">Christoph Lucas, Dominik Raub, and Ueli Maurer</div> <div class="venue"> Proc. of the 2010 ACM Symposium on Principles of Distributed Computing — PODC '10, pp. 219–228, Jul 2010, Full Version available from <a href="http://eprint.iacr.org/2009/009">http://eprint.iacr.org/2009/009</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/LuRaMa10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/LuRaMa10.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/LuRaMa10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Theoretical Gap Between Synchronous and Asynchronous MPC Protocols</h3> <div class="authors">Zuzana Beerliova-Trubiniova, Martin Hirt, and Jesper Buus Nielsen</div> <div class="venue"> Proc. of the 2010 ACM Symposium on Principles of Distributed Computing — PODC '10, pp. 211–218, Jul 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/BeHiNi10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/BeHiNi10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Receipt-Free K-out-of-L Voting Based on ElGamal Encryption</h3> <div class="authors">Martin Hirt</div> <div class="venue"> Towards Trustworthy Elections, Lecture Notes in Computer Science, Springer-Verlag, vol. 6000, pp. 64–82, Jun 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/Hirt10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Hirt10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Adaptively Secure Broadcast</h3> <div class="authors">Martin Hirt and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6110, pp. 466–485, May 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/HirZik10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirZik10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Rate Distortion Bounds for Binary Erasure Source Using Sparse Graph Codes</h3> <div class="authors">Grégory Demay, Vishwambhar Rathi, and Lars K. Rasmussen</div> <div class="venue"> Proceedings of the Data Compression Conference, IEEE Computer Society, Mar 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/DeRaRa10a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DeRaRa10a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch</h3> <div class="authors">Ueli Maurer and Stefano Tessaro</div> <div class="venue"> Theory of Cryptography — TCC 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 5978, pp. 237–254, Feb 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/MauTes10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauTes10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Constructive Cryptography – A Primer</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Financial Cryptography 2010, Lecture Notes in Computer Science, Springer-Verlag, vol. 6052, pp. 1, Jan 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer10a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer10a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems</h3> <div class="authors">Simon Knellwolf, Willi Meier, and María Naya-Plasencia</div> <div class="venue"> ASIACRYPT, Lecture Notes in Computer Science, Springer, vol. 6477, pp. 130–145, 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/KnMePl10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KnMePl10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Differential and Invertibility Properties of BLAKE</h3> <div class="authors">Jean-Philippe Aumasson, Jian Guo, Simon Knellwolf, Krystian Matusiewicz, and Willi Meier</div> <div class="venue"> FSE, Lecture Notes in Computer Science, Springer, vol. 6147, pp. 318–332, 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/AJKMM10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AJKMM10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Free-Start Distinguishing: Combining Two Types of Indistinguishability Amplification</h3> <div class="authors">Peter Gaži and Ueli Maurer</div> <div class="venue"> The 4th International Conference on Information Theoretic Security - ICITS 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 28–44, 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/GazMau09b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GazMau09b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Improved Linear Differential Attacks on CubeHash</h3> <div class="authors">Shahram Khazaei, Simon Knellwolf, Willi Meier, and Deian Stefan</div> <div class="venue"> AFRICACRYPT, Lecture Notes in Computer Science, Springer, vol. 6055, pp. 407–418, 2010. </div> <ul class="publinks"> <li> <a href="/publications/files/KKMS10.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KKMS10.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2009"> <h2>Publications of 2009</h2> <article class="pubentry"> <h3>A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical</h3> <div class="authors">Anja Lehmann and Stefano Tessaro</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5912, pp. 364–381, Dec 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/LehTes09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/LehTes09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cascade Encryption Revisited</h3> <div class="authors">Peter Gaži and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5912, pp. 37–51, Dec 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/GazMau09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/GazMau09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Abstraction in Cryptography</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 459, Aug 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer09b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer09b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer09b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Collusion-Free Multiparty Computation in the Mediated Model</h3> <div class="authors">Joël Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, and Ivan Visconti</div> <div class="venue"> Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 524-540, Aug 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/AKLPSV09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AKLPSV09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Computational Indistinguishability Amplification: Tight Product Theorems for System Composition</h3> <div class="authors">Ueli Maurer and Stefano Tessaro</div> <div class="venue"> Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5677, pp. 350–368, Aug 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/MauTes09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauTes09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model</h3> <div class="authors">Joël Alwen, Yevgeniy Dodis, and Daniel Wichs</div> <div class="venue"> Advances in Cryptology — CRYPTO 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 36-54, Aug 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/AlDoWi09a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AlDoWi09a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unifying Zero-knowledge Proofs of Knowledge</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology - AfricaCrypt 2009, Lecture Notes in Computer Science, Springer-Verlag, Jun 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Breaking RSA Generically is Equivalent to Factoring</h3> <div class="authors">Divesh Aggarwal and Ueli Maurer</div> <div class="venue"> Advances in Cryptology - EUROCRYPT 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5479, pp. 36-53, Apr 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/AggMau09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AggMau09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Realistic Failures in Secure Multi-party Computation</h3> <div class="authors">Vassilis Zikas , Sarah Hauser , and Ueli Maurer</div> <div class="venue"> Theory of Cryptography Conference — TCC 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5444, pp. 274-293, Mar 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/ZiHaMa09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ZiHaMa09.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ZiHaMa09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secure Computability of Functions in the IT setting with Dishonest Majority and Applications to Long-Term Security</h3> <div class="authors">Robin Künzler, Jörn Müller-Quade, and Dominik Raub</div> <div class="venue"> Theory of Cryptography — TCC 2009, Lecture Notes in Computer Science, Springer-Verlag, Mar 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/KuMuRa09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KuMuRa09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Abstract Storage Devices</h3> <div class="authors">Robert Koenig, Ueli Maurer, and Stefano Tessaro</div> <div class="venue"> Theory and Practice of Computer Science — SOFSEM 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5404, pp. 341–352, Jan 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/KoMaTe09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KoMaTe09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generating Shorter Bases for Hard Random Lattices</h3> <div class="authors">Joël Alwen and Chris Peikert</div> <div class="venue"> 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, vol. 3, pp. 75-86, 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/AlPe09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AlPe09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Random Systems: Theory and Applications</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> ICITS 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4883, pp. 44–45, 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer09c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer09c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Survey: Leakage Resilience and the Bounded Retrieval Model</h3> <div class="authors">Joël Alwen, Yevgeniy Dodis, and Daniel Wichs</div> <div class="venue"> Information Theoretic Security, 4th International Conference, ICITS 2009, Lecture Notes in Computer Science, Springer-Verlag, vol. 5973, pp. 1-18, 2009. </div> <ul class="publinks"> <li> <a href="/publications/files/AlDoWi09.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AlDoWi09.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2008"> <h2>Publications of 2008</h2> <article class="pubentry"> <h3>Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography</h3> <div class="authors">Ueli Maurer and Stefano Tessaro</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 161–178, Dec 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/MauTes08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauTes08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>MPC vs. SFE: Unconditional and Computational Security</h3> <div class="authors">Martin Hirt, Ueli Maurer, and Vassilis Zikas</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5350, pp. 1–18, Dec 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/HiMaZi08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HiMaZi08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Multi-Party Computation with Information-Theoretic Security</h3> <div class="authors">Zuzana Beerliova-Trubiniova</div> <div class="venue"> PhD Thesis, ETH Zurich, 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/Beerli08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Beerli08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Collusion-Free Protocols in the Mediated Model</h3> <div class="authors">Joël Alwen, Abhi Shelat, and Ivan Visconti</div> <div class="venue"> Advances in Cryptology — CRYPTO 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5157, pp. 497-514, Aug 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/AlShVi08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AlShVi08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Asynchronous Multi-Party Computation With Quadratic Communication</h3> <div class="authors">Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek</div> <div class="venue"> Automata, Languages and Programming — ICALP 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5126, pp. 473–485, Jul 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/HiNiPr08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HiNiPr08.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HiNiPr08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Rethinking Digital Signatures</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Proc. of SECRYPT 2008, INSTICC, pp. IS-31–IS-33, Jul 2008. </div> <ul class="publinks"> <li><a href="/publications/Maurer08a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Weak Pseudorandom Functions in Minicrypt</h3> <div class="authors">Krzysztof Pietrzak and Johan Sjödin</div> <div class="venue"> Automata, Languages and Programming — ICALP 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 5126, pp. 423–436, Jul 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/PieSjo08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/PieSjo08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Bare Bounded-storage Model: The Tight Bound on the Storage Requirement for Key Agreement</h3> <div class="authors">Stefan Dziembowski and Ueli Maurer</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 54, no. 6, pp. 2790–2792, Jun 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/DziMau08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/DziMau08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Perfectly-Secure MPC with Linear Communication Complexity</h3> <div class="authors">Zuzana Beerliova-Trubiniova and Martin Hirt</div> <div class="venue"> Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 213–230, Mar 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/BeeHir08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BeeHir08.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BeeHir08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>MPC vs. SFE: Perfect Security in a Unified Corruption Model</h3> <div class="authors">Zuzana Beerliova-Trubiniova, Matthias Fitzi, Martin Hirt, Ueli Maurer, and Vassilis Zikas</div> <div class="venue"> Theory of Cryptography Conference — TCC 2008, Lecture Notes in Computer Science, Springer-Verlag, vol. 4948, pp. 231–250, Mar 2008. </div> <ul class="publinks"> <li> <a href="/publications/files/BFHMZ08.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BFHMZ08.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BFHMZ08.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2007"> <h2>Publications of 2007</h2> <article class="pubentry"> <h3>Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations</h3> <div class="authors">Ueli Maurer and Dominik Raub</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 427–443, Dec 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/MauRau07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauRau07.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauRau07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Byzantine Agreement with Faulty Minority</h3> <div class="authors">Zuzana Beerliova-Trubiniova, Martin Hirt, and Micha Riser</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 393 - 409, Dec 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/BeHiRi07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BeHiRi07.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BeHiRi07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Simple and Efficient Perfectly-Secure Asynchronous MPC</h3> <div class="authors">Zuzana Beerliova-Trubiniova and Martin Hirt</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4833, pp. 376–392, Dec 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/BeeHir07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BeeHir07.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BeeHir07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Domain Extension of Public Random Functions: Beyond the Birthday Barrier</h3> <div class="authors">Ueli Maurer and Stefano Tessaro</div> <div class="venue"> Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 187–204, Aug 2007, Full version available from <a href="http://eprint.iacr.org/2007/229">http://eprint.iacr.org/2007/229</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauTes07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauTes07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Indistinguishability Amplification</h3> <div class="authors">Ueli Maurer, Krzysztof Pietrzak, and Renato Renner</div> <div class="venue"> Advances in Cryptology — CRYPTO 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4622, pp. 130–149, Aug 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/MaPiRe07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MaPiRe07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Quantum Cryptography with Finite Resources</h3> <div class="authors">Valerio Scarani and Renato Renner</div> <div class="venue"> Available on <a href="http://arxiv.org/abs/0708.0709">http://arxiv.org/abs/0708.0709</a>, Aug 2007. </div> <ul class="publinks"> <li><a href="/publications/ScaRen07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Symmetry of large physical systems implies independence of subsystems</h3> <div class="authors">Renato Renner</div> <div class="venue"> Nature Physics, vol. 3, pp. 645 - 649, Jul 2007, Preliminary version is available at <a href="http://arxiv.org/abs/quant-ph/0703069">http://arxiv.org/abs/quant-ph/0703069</a>. </div> <ul class="publinks"> <li><a href="/publications/Renner07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Abstract Storage Devices</h3> <div class="authors">Robert Koenig, Ueli Maurer, and Stefano Tessaro</div> <div class="venue"> eprint archive, Jun 2007, Available at <a href="http://www.arxiv.org/abs/0706.2746">http://www.arxiv.org/abs/0706.2746</a>. </div> <ul class="publinks"> <li><a href="/publications/KoMaTe07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Approaches to Efficient and Robust Cryptographic Protocols</h3> <div class="authors">Bartosz Przydatek</div> <div class="venue"> PhD Thesis, ETH Zurich, 2007, Diss. ETH No. 17102, ISBN 978-3-86628-153-0. </div> <ul class="publinks"> <li> <a href="/publications/files/Prz07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Prz07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Parallel Repetition: Simplifications and the No-Signaling Case</h3> <div class="authors">Thomas Holenstein</div> <div class="venue"> Proc. 39th ACM Symposium on Theory of Computing — STOC 2007, pp. 411–419, Jun 2007. </div> <ul class="publinks"> <li><a href="/publications/Holens07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security</h3> <div class="authors">Ueli Maurer and Johan Sjödin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4515, pp. 498–516, May 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/MauSjo07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MauSjo07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Range Extension for Weak PRFs; The Good, the Bad, and the Ugly</h3> <div class="authors">Krzysztof Pietrzak and Johan Sjödin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4515, pp. 517–533, May 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/PieSjo07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/PieSjo07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Small Accessible Quantum Information Does Not Imply Security</h3> <div class="authors">Robert Koenig, Renato Renner, Andor Bariska, and Ueli Maurer</div> <div class="venue"> Physical Review Letters, vol. 98, no. 140502, Apr 2007, Preliminary version available at <a href="http://arxiv.org/abs/quant-ph/0512021">http://arxiv.org/abs/quant-ph/0512021</a>. </div> <ul class="publinks"> <li><a href="/publications/AKMR07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Beweisbare Sicherheit durch Quantenkryptografie</h3> <div class="authors">Renato Renner</div> <div class="venue"> it — Information Technology, Oldenbourg, vol. 49, no. 2, pp. 127–131, Mar 2007, <a href="http://it-information-technology.de/">http://it-information-technology.de/</a> (copyright). </div> <ul class="publinks"> <li> <a href="/publications/files/Renner07d.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Renner07d.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Robuster Combiners for Oblivious Transfer</h3> <div class="authors">Remo Meier, Bartosz Przydatek, and Jürg Wullschleger</div> <div class="venue"> Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 404–418, Feb 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/MePrWu07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MePrWu07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Security of Quantum Key Distribution Protocols using two-way Classical Communication or Weak Coherent Pulses</h3> <div class="authors">Barbara Kraus, Cyril Branciard, and Renato Renner</div> <div class="venue"> Physical Review Letters A, vol. 75, pp. 012316, Jan 2007, Available at <a href="http://arxiv.org/abs/quant-ph/0610151">http://arxiv.org/abs/quant-ph/0610151</a>. </div> <ul class="publinks"> <li><a href="/publications/KrBrRe07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>SIA: Secure Information Aggregation in Sensor Networks</h3> <div class="authors">Haowen Chan, Adrian Perrig, Bartosz Przydatek, and Dawn Song</div> <div class="venue"> Journal of Computer Security, vol. 15, no. 1, pp. 69–102, Jan 2007, Special Issue on Security of Ad-Hoc and Sensor Networks. Preliminary version: <a href="/publications/PrSoPe03.html">[PrSoPe03]</a>. </div> <ul class="publinks"> <li><a href="/publications/CPPS07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Designated Confirmer Signatures Revisited</h3> <div class="authors">Douglas Wikström</div> <div class="venue"> Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 342–361, 2007. </div> <ul class="publinks"> <li><a href="/publications/Wik07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>How to Shuffle in Public</h3> <div class="authors">Ben Adida and Douglas Wikström</div> <div class="venue"> Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, 2007. </div> <ul class="publinks"> <li><a href="/publications/AdWi07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Parallel Repetition of Computationally Sound Protocols Revisited</h3> <div class="authors">Krzysztof Pietrzak and Douglas Wikström</div> <div class="venue"> Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, vol. 4392, pp. 86–102, 2007. </div> <ul class="publinks"> <li><a href="/publications/PiWi07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unbreakable keys from random noise</h3> <div class="authors">Ueli Maurer, Renato Renner, and Stefan Wolf</div> <div class="venue"> Security with Noisy Data, Springer-Verlag, pp. 21–44, 2007. </div> <ul class="publinks"> <li> <a href="/publications/files/MaReWo07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MaReWo07.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MaReWo07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Weak Pseudorandom Functions in Minicrypt</h3> <div class="authors">Krzysztof Pietrzak and Johan Sjödin</div> <div class="venue"> 2007, Manuscript. </div> <ul class="publinks"> <li><a href="/publications/PieSjo07b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Weak Pseudorandomness and Unpredictability</h3> <div class="authors">Johan Sjödin</div> <div class="venue"> PhD Thesis, ETH Zurich, 2007, ETH Series in Information Security and Cryptography, vol. 8, Hartung-Gorre Verlag, ISBN 3-86628-088-2. </div> <ul class="publinks"> <li> <a href="/publications/files/Sjo07.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Sjo07.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Sjo07.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2006"> <h2>Publications of 2006</h2> <article class="pubentry"> <h3>A Tight High-Order Entropic Quantum Uncertainty Relation With Applications</h3> <div class="authors">Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, and Christian Schaffner</div> <div class="venue"> Dec 2006, Available at <a href="http://arxiv.org/abs/quant-ph/0612014">http://arxiv.org/abs/quant-ph/0612014</a>. </div> <ul class="publinks"> <li><a href="/publications/DFRSS06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Algorithms on Graphs with Small Dominating Targets.</h3> <div class="authors">Divesh Aggarwal, Chandan Dubey, and Shashank Mehta</div> <div class="venue"> Algorithms and Computation, 17th International Symposium, ISAAC 2006, Lecture Notes in Computer Science, Springer, vol. 4288, pp. 141-152, Dec 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/AgDuMe06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AgDuMe06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Indistinguishability Amplification</h3> <div class="authors">Ueli Maurer, Krzysztof Pietrzak, and Renato Renner</div> <div class="venue"> Dec 2006, Available at <a href="http://eprint.iacr.org/2006/456">http://eprint.iacr.org/2006/456</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MPR06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/MPR06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On Robust Combiners for Private Information Retrieval and Other Primitives</h3> <div class="authors">Remo Meier and Bartosz Przydatek</div> <div class="venue"> Advances in Cryptology — CRYPTO 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4117, pp. 555–569, Aug 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/MeiPrz06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MeiPrz06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MeiPrz06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Randomness of Independent Experiments</h3> <div class="authors">Thomas Holenstein and Renato Renner</div> <div class="venue"> Aug 2006, Available at <a href="http://arxiv.org/abs/cs.IT/0608007">http://arxiv.org/abs/cs.IT/0608007</a>. </div> <ul class="publinks"> <li><a href="/publications/HolRen06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Robust Multiparty Computation with Linear Communication Complexity</h3> <div class="authors">Martin Hirt and Jesper Buus Nielsen</div> <div class="venue"> Advances in Cryptology — CRYPTO 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4117, pp. 463–482, Aug 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/HirNie06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HirNie06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HirNie06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unifying classical and quantum key distillation</h3> <div class="authors">Matthias Christandl, Artur Ekert, Michal Horodecki, Pawel Horodecki, Jonathan Oppenheim, and Renato Renner</div> <div class="venue"> Theory of Cryptography Conference — TCC 2007, Lecture Notes in Computer Science, Springer-Verlag, Aug 2006, Available at <a href="http://arxiv.org/abs/quant-ph/0608199">http://arxiv.org/abs/quant-ph/0608199</a>. </div> <ul class="publinks"> <li><a href="/publications/CEHHOR06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Impossibility of Extracting Classical Randomness Using a Quantum Computer</h3> <div class="authors">Yevgeniy Dodis and Renato Renner</div> <div class="venue"> Automata, Languages and Programming — ICALP 2006, Springer-Verlag, pp. 204–215, Jul 2006, Available at <a href="http://arxiv.org/abs/quant-ph/0612012">http://arxiv.org/abs/quant-ph/0612012</a>. </div> <ul class="publinks"> <li><a href="/publications/DodRen06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Optimally Efficient Multi-Valued Byzantine Agreement</h3> <div class="authors">Matthias Fitzi and Martin Hirt</div> <div class="venue"> Proc. 25th ACM Symposium on Principles of Distributed Computing — PODC 2006, ACM, Jul 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/FitHir06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FitHir06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FitHir06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Parallel Repetition: Simplifications and the No-Signaling Case</h3> <div class="authors">Thomas Holenstein</div> <div class="venue"> Jul 2006, Available at <a href="http://arxiv.org/abs/cs.CC/0607139">http://arxiv.org/abs/cs.CC/0607139</a>. </div> <ul class="publinks"> <li><a href="/publications/Holens06c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The single-serving channel capacity</h3> <div class="authors">Renato Renner, Stefan Wolf, and Jürg Wullschleger</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2006, IEEE, Jul 2006, Available at <a href="http://arxiv.org/abs/cs.IT/0608018">http://arxiv.org/abs/cs.IT/0608018</a>. </div> <ul class="publinks"> <li><a href="/publications/ReWoWu06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction</h3> <div class="authors">Dominik Raub and Rainer Steinwandt</div> <div class="venue"> Emerging Trends in Information and Communication Security — ETRICS 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3995, pp. 130–144, Jun 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/RauSte06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RauSte06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RauSte06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Optimal Resilience for Erasure-Coded Byzantine Distributed Storage</h3> <div class="authors">Christian Cachin and Stefano Tessaro</div> <div class="venue"> Proc. Intl. Conference on Dependable Systems and Networks — DSN 2006, pp. 115–124, Jun 2006. </div> <ul class="publinks"> <li><a href="/publications/CacTes06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Luby-Rackoff Ciphers from Weak Round Functions?</h3> <div class="authors">Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, and Johan Sjödin</div> <div class="venue"> Cryptology ePrint Archive, Report 2006/213, Jun 2006, <a href="http://eprint.iacr.org/2006.">http://eprint.iacr.org/2006.</a> This is the full version of <a href="/publications/MOPS06a.html">[MOPS06a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MOPS06b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MOPS06b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MOPS06b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Strengthening Key Agreement using Hard-Core Sets</h3> <div class="authors">Thomas Holenstein</div> <div class="venue"> PhD Thesis, ETH Zurich, 2006, Reprint as vol. 7 of ETH Series in Information Security and Cryptography, ISBN 3-86626-088-2, Hartung-Gorre Verlag, Konstanz, 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/Holens06b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Holens06b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Luby-Rackoff Ciphers from Weak Round Functions?</h3> <div class="authors">Ueli Maurer, Yvonne Anne Oswald, Krzysztof Pietrzak, and Johan Sjödin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4004, pp. 391–408, May 2006, Proceedings version of <a href="/publications/MOPS06b.html">[MOPS06b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MOPS06a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MOPS06a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MOPS06a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Multi-Party Computation with Dispute Control</h3> <div class="authors">Zuzana Beerliova-Trubiniova and Martin Hirt</div> <div class="venue"> Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3876, pp. 305–328, Mar 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/BeeHir06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BeeHir06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BeeHir06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness</h3> <div class="authors">Thomas Holenstein</div> <div class="venue"> Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, pp. 443–461, Mar 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/Holens06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Holens06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Holens06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Separating Sources for Encryption and Secret Sharing</h3> <div class="authors">Yevgeniy Dodis, Krzysztof Pietrzak, and Bartosz Przydatek</div> <div class="venue"> Theory of Cryptography Conference — TCC 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 3876, pp. 601–616, Mar 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/DoPiPr06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/DoPiPr06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/DoPiPr06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>One-and-a-half quantum de Finetti theorems</h3> <div class="authors">Matthias Christandl, Robert Koenig, Graeme Mitchison, and Renato Renner</div> <div class="venue"> Feb 2006, Available at <a href="http://arxiv.org/abs/quant-ph/0602130">http://arxiv.org/abs/quant-ph/0602130</a>. </div> <ul class="publinks"> <li><a href="/publications/CKMR06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>An Adaptively Secure Mix-Net Without Erasures</h3> <div class="authors">Douglas Wikström and Jens Groth</div> <div class="venue"> Automata, Languages and Programming — ICALP 2006, Lecture Notes in Computer Science, Springer-Verlag, vol. 4052, pp. 276–287, 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/WiGr06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/WiGr06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secure Multi-party Computation made Simple</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Discrete Applied Mathematics, vol. 154, pp. 370–381, 2006. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer06.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer06.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer06.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2005"> <h2>Publications of 2005</h2> <article class="pubentry"> <h3>A de Finetti Representation for Finite Symmetric Quantum States</h3> <div class="authors">Robert Koenig and Renato Renner</div> <div class="venue"> Journal of Mathematical Physics, vol. 46, no. 122108, Dec 2005, See also <a href="http://arxiv.org/abs/quant-ph/0410229">http://arxiv.org/abs/quant-ph/0410229</a>. </div> <ul class="publinks"> <li><a href="/publications/KoeRen04b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Abstract Models of Computation in Cryptography</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 1–12, Dec 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Maurer05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Domain Expansion of MACs: Alternative Uses of the FIL-MAC</h3> <div class="authors">Ueli Maurer and Johan Sjödin</div> <div class="venue"> Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 168–185, Dec 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/MauSjo05b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauSjo05b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauSjo05b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generalized Strong Extractors and Deterministic Privacy Amplification</h3> <div class="authors">Robert Koenig and Ueli Maurer</div> <div class="venue"> Cryptography and Coding 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3796, pp. 322–339, Dec 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/KoeMau05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KoeMau05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Simple and Tight Bounds for Information Reconciliation and Privacy Amplification</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3788, pp. 199–216, Dec 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation</h3> <div class="authors">Martin Hirt and Jesper Buus Nielsen</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3788, pp. 79–99, Dec 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/HirNie05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HirNie05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HirNie05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Asynchronous Verifiable Information Dispersal</h3> <div class="authors">Christian Cachin and Stefano Tessaro</div> <div class="venue"> Proceedings of the 24th Symposium on Reliable Distributed Systems — SRDS 2005, pp. 191–202, Oct 2005. </div> <ul class="publinks"> <li><a href="/publications/CacTes05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Security of Quantum Key Distribution</h3> <div class="authors">Renato Renner</div> <div class="venue"> PhD Thesis, ETH Zurich, 2005, Available at <a href="http://arxiv.org/abs/quant-ph/0512258">http://arxiv.org/abs/quant-ph/0512258</a>. </div> <ul class="publinks"> <li><a href="/publications/Renner05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Communication-Efficient Non-Interactive Proofs of Knowledge with Online Extractors</h3> <div class="authors">Marc Fischlin</div> <div class="venue"> Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 152–168, Aug 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/Fischl05b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Fischl05b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Fischl05b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Composition Does Not Imply Adaptive Security</h3> <div class="authors">Krzysztof Pietrzak</div> <div class="venue"> Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 55–65, Aug 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/Pietrz05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Pietrz05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Pietrz05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Impossibility and Feasibility Results for Zero Knowledge with Public Keys</h3> <div class="authors">Joël Alwen, Giuseppe Persiano, and Ivan Visconti</div> <div class="venue"> Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 135-151, Aug 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/AlPeVi05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AlPeVi05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Improved Security Analyses for CBC MACs</h3> <div class="authors">Mihir Bellare, Krzysztof Pietrzak, and Phillip Rogaway</div> <div class="venue"> Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 527–545, Aug 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/BePiRo05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BePiRo05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BePiRo05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Lower and Upper Bounds on the Secret Key Rate for QKD Protocols Using One-Way Classical Communication</h3> <div class="authors">Barbara Kraus, Nicolas Gisin, and Renato Renner</div> <div class="venue"> Physical Review Letters, American Physical Society, vol. 95, no. 080501, Aug 2005, eprint archive: <a href="http://arxiv.org/abs/quant-ph/0410215">http://arxiv.org/abs/quant-ph/0410215</a>. </div> <ul class="publinks"> <li><a href="/publications/KrGiRe04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Generic Insecurity of the Full Domain Hash</h3> <div class="authors">Yevgeniy Dodis, Roberto Oliveira, and Krzysztof Pietrzak</div> <div class="venue"> Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3621, pp. 449–466, Aug 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/DoOlPi05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/DoOlPi05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/DoOlPi05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption</h3> <div class="authors">Thomas Holenstein and Renato Renner</div> <div class="venue"> Advances in Cryptology — CRYPTO 2005, Lecture Notes in Computer Science, Springer-Verlag, pp. 478–493, Aug 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/HolRen05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HolRen05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HolRen05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>An Information-Theoretic Security Proof for QKD Protocols</h3> <div class="authors">Renato Renner, Nicolas Gisin, and Barbara Kraus</div> <div class="venue"> Physical Review Letters A, American Physical Society, vol. 72, no. 012332, Jul 2005, eprint archive: <a href="http://arxiv.org/abs/quant-ph/0502064">http://arxiv.org/abs/quant-ph/0502064</a>. </div> <ul class="publinks"> <li><a href="/publications/ReGiKr05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Completely Non-Malleable Schemes</h3> <div class="authors">Marc Fischlin</div> <div class="venue"> Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 779–790, Jul 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/Fischl05a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Fischl05a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Fischl05a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Power of Quantum Memory</h3> <div class="authors">Robert Koenig, Ueli Maurer, and Renato Renner</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 51, no. 7, pp. 2391–2401, Jul 2005, eprint archive: <a href="http://arxiv.org/abs/quant-ph/0305154">http://arxiv.org/abs/quant-ph/0305154</a>. </div> <ul class="publinks"> <li><a href="/publications/KoMaRe03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Single-key AIL-MACs from any FIL-MAC</h3> <div class="authors">Ueli Maurer and Johan Sjödin</div> <div class="venue"> Automata, Languages and Programming — ICALP 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3580, pp. 472–484, Jul 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/MauSjo05a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauSjo05a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauSjo05a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Byzantine Agreement Given Partial Broadcast</h3> <div class="authors">Jeffrey Considine, Matthias Fitzi, Matthew Franklin, Leonid A. Levin, Ueli Maurer, and David Metcalf</div> <div class="venue"> Journal of Cryptology, vol. 18, no. 3, pp. 191–217, Jul 2005. </div> <ul class="publinks"> <li><a href="/publications/CFFLMM05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Domination Search on Graphs with Low Dominating-Target-Number</h3> <div class="authors">Divesh Aggarwal, Shashank Mehta, and Jitender Deogun</div> <div class="venue"> Graph-Theoretic Concepts in Computer Science, WG 2005, Lecture Notes in Computer Science, Springer, vol. 3787, pp. 28-37, Jun 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/AgMeDe05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/AgMeDe05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience</h3> <div class="authors">Martin Hirt, Jesper Buus Nielsen, and Bartosz Przydatek</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3494, pp. 322–340, May 2005, Full version available as Report 2004/368 at Cryptology ePrint Archive, <a href="http://eprint.iacr.org/2004/368">http://eprint.iacr.org/2004/368</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/HiNiPr05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HiNiPr05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HiNiPr05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Key Agreement from Weak Bit Agreement</h3> <div class="authors">Thomas Holenstein</div> <div class="venue"> Proc. 37th ACM Symposium on Theory of Computing — STOC 2005, pp. 664–673, May 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/Holens05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Holens05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Holens05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Solving Medium-Density Subset Sum Problems in Expected Polynomial Time</h3> <div class="authors">Abraham D. Flaxman and Bartosz Przydatek</div> <div class="venue"> Proc. 22nd Symposium on Theoretical Aspects of Computer Science — STACS 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3404, pp. 305–314, Feb 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/FlaPrz05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FlaPrz05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FlaPrz05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Universally Composable Privacy Amplification Against Quantum Adversaries</h3> <div class="authors">Renato Renner and Robert Koenig</div> <div class="venue"> Theory of Cryptography Conference — TCC 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3378, pp. 407–425, Feb 2005, Also available at <a href="http://arxiv.org/abs/quant-ph/0403133">http://arxiv.org/abs/quant-ph/0403133</a>. </div> <ul class="publinks"> <li><a href="/publications/RenKoe05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order</h3> <div class="authors">Endre Bangerter, Jan Camenisch, and Ueli Maurer</div> <div class="venue"> Public Key Cryptography — PKC 2005, Lecture Notes in Computer Science, Springer-Verlag, vol. 3386, pp. 154–171, Jan 2005. </div> <ul class="publinks"> <li> <a href="/publications/files/BaCaMa05.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BaCaMa05.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BaCaMa05.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2004"> <h2>Publications of 2004</h2> <article class="pubentry"> <h3>Asynchronous Proactive Cryptosystems Without Agreement (extended abstract)</h3> <div class="authors">Bartosz Przydatek and Reto Strobl</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3329, pp. 152–169, Dec 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/PrzStr04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/PrzStr04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/PrzStr04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards a Theory of Consistency Primitives</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> International Symposium on Distributed Computing — DISC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3274, pp. 379–389, Oct 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer04c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer04c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer04c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Complete Classification of Bilinear Hard-Core Functions</h3> <div class="authors">Thomas Holenstein, Ueli Maurer, and Johan Sjödin</div> <div class="venue"> Advances in Cryptology — CRYPTO 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3152, pp. 73–91, Aug 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/HoMaSj04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HoMaSj04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HoMaSj04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Extracting Randomness from Generalized Symbol-Fixing and Markov Sources</h3> <div class="authors">Robert Koenig and Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 232, Jun 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/KoeMau04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/KoeMau04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>New Approaches to Digital Evidence</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Proceedings of the IEEE, vol. 92, no. 6, pp. 933–947, Jun 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On Intrinsic Information</h3> <div class="authors">Matthias Christandl and Renato Renner</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 135, Jun 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/ChrRen04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ChrRen04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ChrRen04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Privacy Amplification Secure Against an Adversary with Selectable Knowledge</h3> <div class="authors">Robert Koenig, Ueli Maurer, and Renato Renner</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 231, Jun 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/KoMaRe04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/KoMaRe04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/KoMaRe04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Quantum Pseudo-Telepathy and the Kochen-Specker Theorem</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 322, Jun 2004, This is the Proceedings version of <a href="/publications/RenWol04d.html">[RenWol04d]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol04c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol04c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol04c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Smooth Renyi Entropy and Applications</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2004, IEEE, pp. 233, Jun 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol04a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol04a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol04a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Role of Cryptography in Database Security</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Proc. of ACM SIGMOD Int. Conference on Management of Data, pp. 5–10, Jun 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer04b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer04b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer04b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Multi-party Computation with Hybrid Security</h3> <div class="authors">Matthias Fitzi, Thomas Holenstein, and Jürg Wullschleger</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 419–438, May 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/FiHoWu04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FiHoWu04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FiHoWu04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On Generating the Initial Key in the Bounded-Storage Model</h3> <div class="authors">Stefan Dziembowski and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 126–137, May 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/DziMau04b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/DziMau04b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/DziMau04b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Exact Price for Unconditionally Secure Asymmetric Cryptography</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 3027, pp. 109–125, May 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Composition of Random Systems: When Two Weak Make One Strong</h3> <div class="authors">Ueli Maurer and Krzysztof Pietrzak</div> <div class="venue"> Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 410–427, Feb 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/MauPie04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauPie04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauPie04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology</h3> <div class="authors">Ueli Maurer, Renato Renner, and Clemens Holenstein</div> <div class="venue"> Theory of Cryptography Conference — TCC 2004, Lecture Notes in Computer Science, Springer-Verlag, vol. 2951, pp. 21–39, Feb 2004. </div> <ul class="publinks"> <li> <a href="/publications/files/MaReHo04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MaReHo04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MaReHo04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Optimal Randomizer Efficiency in the Bounded-Storage Model</h3> <div class="authors">Stefan Dziembowski and Ueli Maurer</div> <div class="venue"> Journal of Cryptology, vol. 17, no. 1, pp. 5–26, Jan 2004, Conference version appeared in Proc. of STOC 2002.. </div> <ul class="publinks"> <li> <a href="/publications/files/DziMau04a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/DziMau04a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/DziMau04a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Generic Security Proof for Quantum Key Distribution</h3> <div class="authors">Matthias Christandl, Renato Renner, and Artur Ekert</div> <div class="venue"> eprint archive, 2004, <a href="http://arxiv.org/abs/quant-ph/0402131">http://arxiv.org/abs/quant-ph/0402131</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/ChReEk04.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ChReEk04.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ChReEk04.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Quantum Pseudo-Telepathy and the Kochen-Specker Theorem</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> 2004, Proceedings version (ISIT 2004): <a href="/publications/RenWol04c.html">[RenWol04c]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol04d.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol04d.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol04d.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2003"> <h2>Publications of 2003</h2> <article class="pubentry"> <h3>On the Frequency Distribution of Non-Independent Random Values</h3> <div class="authors">Thomas Holenstein and Renato Renner</div> <div class="venue"> Nov 2003, Manuscript. </div> <ul class="publinks"> <li> <a href="/publications/files/HolRen03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HolRen03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HolRen03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Variational Distance of Independently Repeated Experiments</h3> <div class="authors">Renato Renner</div> <div class="venue"> eprint archive: <a href="http://arxiv.org/abs/cs.IT/0509013">http://arxiv.org/abs/cs.IT/0509013</a>, Nov 2003, Manuscript. </div> <ul class="publinks"> <li><a href="/publications/Renner03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>SIA: Secure Information Aggregation in Sensor Networks</h3> <div class="authors">Bartosz Przydatek, Dawn Song, and Adrian Perrig</div> <div class="venue"> Proc. ACM Conference on Embedded Networked Sensor Systems — SENSYS 2003, ACM, pp. 255–265, Nov 2003, Journal version: <a href="/publications/CPPS07.html">[CPPS07]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/PrSoPe03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/PrSoPe03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/PrSoPe03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Intrinsic Limitations of Digital Signatures and How to Cope With Them</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Proceedings of the 6th Information Security Conference — ISC '03, Lecture Notes in Computer Science, Springer-Verlag, vol. 2851, pp. 180–192, Oct 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer03a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer03a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer03a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Parameterized Complexity of the Fixed Alphabet Shortest Common Supersequence and Longest Common Subsequence Problems</h3> <div class="authors">Krzysztof Pietrzak</div> <div class="venue"> Journal of Computer and System Sciences, vol. 67, no. 1, pp. 757–771, Aug 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/Pietrz03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Pietrz03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Pietrz03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — CRYPTO 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2729, pp. 78–95, Aug 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol03b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol03b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol03b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A New Measure for Conditional Mutual Information and its Properties</h3> <div class="authors">Renato Renner, Juraj Skripsky, and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 259, Jun 2003, This is the proceedings version of <a href="/publications/ReSkWo03a.html">[ReSkWo03a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/ReSkWo03b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ReSkWo03b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ReSkWo03b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Property of the Intrinsic Mutual Information</h3> <div class="authors">Matthias Christandl, Renato Renner, and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 258, Jun 2003, This is the proceedings version of <a href="/publications/ChReWo03a.html">[ChReWo03a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/ChReWo03b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ChReWo03b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ChReWo03b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards Characterizing the Non-Locality of Entangled Quantum States</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2003, IEEE, pp. 428, Jun 2003, This is the proceedings version of <a href="/publications/RenWol02c.html">[RenWol02c]</a>, eprint archive: <a href="http://arxiv.org/abs/quant-ph/0211019">http://arxiv.org/abs/quant-ph/0211019</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol03c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol03c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol03c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>New Bounds in Secret-Key Agreement: The Gap Between Formation and Secrecy Extraction</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2656, pp. 562–577, May 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations</h3> <div class="authors">Ueli Maurer and Krzysztof Pietrzak</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, pp. 544–561, May 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/MauPie03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauPie03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauPie03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Two-Threshold Broadcast and Detectable Multi-Party Computation</h3> <div class="authors">Matthias Fitzi, Martin Hirt, Thomas Holenstein, and Jürg Wullschleger</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2003, Lecture Notes in Computer Science, Springer-Verlag, vol. 2656, pp. 51–67, May 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/FHHW03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FHHW03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FHHW03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secret Key Agreement Over a Non-authenticated Channel — Part III: Privacy Amplification</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 839–851, Apr 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol03c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol03c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol03c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secret Key Agreement Over a Non-authenticated Channel — Part II: The Simulatability Condition</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 832–838, Apr 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol03b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol03b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol03b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secret Key Agreement Over a Non-authenticated Channel — Part I: Definitions and Bounds</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 822–831, Apr 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol03a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol03a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol03a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generalized Communication and Security Models in Byzantine Agreement</h3> <div class="authors">Matthias Fitzi</div> <div class="venue"> PhD Thesis, ETH Zurich, 2003, Reprint as vol. 4 of ETH Series in Information Security and Cryptography, ISBN 3-89649-853-3, Hartung-Gorre Verlag, Konstanz, 2003. </div> <ul class="publinks"> <li> <a href="/publications/files/Fitzi03.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Fitzi03.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Fitzi03.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A New Measure for Conditional Mutual Information and its Properties</h3> <div class="authors">Renato Renner, Juraj Skripsky, and Stefan Wolf</div> <div class="venue"> 2003, Proceedings version (ISIT 2003): <a href="/publications/ReSkWo03b.html">[ReSkWo03b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/ReSkWo03a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ReSkWo03a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ReSkWo03a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Property of the Intrinsic Mutual Information</h3> <div class="authors">Matthias Christandl, Renato Renner, and Stefan Wolf</div> <div class="venue"> 2003, Proceedings version (ISIT 2003): <a href="/publications/ChReWo03b.html">[ChReWo03b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/ChReWo03a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/ChReWo03a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/ChReWo03a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2002"> <h2>Publications of 2002</h2> <article class="pubentry"> <h3>Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement?</h3> <div class="authors">Nicolas Gisin, Renato Renner, and Stefan Wolf</div> <div class="venue"> Algorithmica, Springer-Verlag, vol. 34, no. 4, pp. 389–412, Nov 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/GiReWo02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/GiReWo02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/GiReWo02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secure Multi-Party Computation Made Simple</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Third Conference on Security in Communication Networks — SCN 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2576, pp. 14–28, Sep 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer02b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer02b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer02b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Fast Approximation Algorithm for the Subset-Sum Problem</h3> <div class="authors">Bartosz Przydatek</div> <div class="venue"> International Transactions in Operational Research, Blackwell Publishers, vol. 9, no. 4, pp. 437–459, Aug 2002, A preliminary version of this paper was presented at IFORS '99, 15th Triennial Conference of IFORS. </div> <ul class="publinks"> <li> <a href="/publications/files/Przyda02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Przyda02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Przyda02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks</h3> <div class="authors">Serge Fehr and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2442, pp. 565–580, Aug 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/FehMau02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FehMau02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FehMau02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Detectable Byzantine Agreement Secure Against Faulty Majorities</h3> <div class="authors">Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, and Adam Smith</div> <div class="venue"> Proc. 21st ACM Symposium on Principles of Distributed Computing — PODC 2002, pp. 118–126, Jul 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/FGHHS02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FGHHS02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FGHHS02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>About the Mutual (Conditional) Information</h3> <div class="authors">Renato Renner and Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 364, Jun 2002, This is the Proceedings version of <a href="/publications/RenMau02a.html">[RenMau02a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenMau02b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenMau02b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenMau02b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generalized Indistinguishability</h3> <div class="authors">Ueli Maurer and Renato Renner</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 295, Jun 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/MauRen02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauRen02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauRen02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards Proving the Existence of “Bound” Information</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2002, IEEE, pp. 103, Jun 2002, This is the Proceedings version of <a href="/publications/RenWol02a.html">[RenWol02a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol02b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol02b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol02b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Indistinguishability of Random Systems</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 110–132, May 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Tight Security Proofs for the Bounded-Storage Model</h3> <div class="authors">Stefan Dziembowski and Ueli Maurer</div> <div class="venue"> Proc. 34th ACM Symposium on Theory of Computing — STOC 2002, ACM, pp. 341–350, May 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/DziMau02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/DziMau02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/DziMau02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unconditional Byzantine Agreement and Multi-Party Computation Secure Against Dishonest Minorities from Scratch</h3> <div class="authors">Matthias Fitzi, Nicolas Gisin, Ueli Maurer, and Oliver von Rotz</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2002, Lecture Notes in Computer Science, Springer-Verlag, vol. 2332, pp. 482–501, May 2002. </div> <ul class="publinks"> <li> <a href="/publications/files/FGMR02.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FGMR02.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FGMR02.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>About the Mutual (Conditional) Information</h3> <div class="authors">Renato Renner and Ueli Maurer</div> <div class="venue"> 2002, Proceedings version (ISIT 2002): <a href="/publications/RenMau02b.html">[RenMau02b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenMau02a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenMau02a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenMau02a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards Characterizing the Non-Locality of Entangled Quantum States</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> eprint archive: <a href="http://arxiv.org/abs/quant-ph/0211019">http://arxiv.org/abs/quant-ph/0211019</a>, 2002, Proceedings version (ISIT 2003): <a href="/publications/RenWol03c.html">[RenWol03c]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol02c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol02c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol02c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards Proving the Existence of “Bound” Information</h3> <div class="authors">Renato Renner and Stefan Wolf</div> <div class="venue"> 2002, Proceedings version (ISIT 2002): <a href="/publications/RenWol02b.html">[RenWol02b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/RenWol02a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/RenWol02a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/RenWol02a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2001"> <h2>Publications of 2001</h2> <article class="pubentry"> <h3>Quantum Solution to the Byzantine Agreement Problem</h3> <div class="authors">Matthias Fitzi, Nicolas Gisin, and Ueli Maurer</div> <div class="venue"> Physical Review Letters, vol. 87, no. 21, pp. 7901–7904, Nov 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/FiGiMa01.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FiGiMa01.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FiGiMa01.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Multi-Party Computation: Efficient Protocols, General Adversaries, and Voting</h3> <div class="authors">Martin Hirt</div> <div class="venue"> PhD Thesis, ETH Zurich, 2001, Reprint as vol. 3 of ETH Series in Information Security and Cryptography, ISBN 3-89649-747-2, Hartung-Gorre Verlag, Konstanz, 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/Hirt01.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Hirt01.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Minimal Complete Primitives for Secure Multi-Party Computation</h3> <div class="authors">Matthias Fitzi, Juan A. Garay, Ueli Maurer, and Rafail Ostrovsky</div> <div class="venue"> Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, pp. 80–100, Aug 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/FGMO01.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FGMO01.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FGMO01.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase</h3> <div class="authors">Ronald Cramer, Ivan Damgård, and Serge Fehr</div> <div class="venue"> Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 503–523, Aug 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/CrDaFe01.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CrDaFe01.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CrDaFe01.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Robustness for Free in Unconditional Multi-Party Computation</h3> <div class="authors">Martin Hirt and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2139, pp. 101–118, Aug 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/HirMau01.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/HirMau01.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On Adaptive vs. Non-adaptive Security of Multiparty Protocols</h3> <div class="authors">Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, and Tal Malkin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2001, Lecture Notes in Computer Science, Springer-Verlag, vol. 2045, pp. 262–279, May 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/CDDIM01.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/CDDIM01.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cryptography $2000\pm 10$</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Informatics — 10 Years Back, 10 Years Ahead, Lecture Notes in Computer Science, Springer-Verlag, vol. 2000, pp. 63–85, 2001. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer00b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer00b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer00b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y2000"> <h2>Publications of 2000</h2> <article class="pubentry"> <h3>Efficient Secure Multi-Party Computation</h3> <div class="authors">Martin Hirt, Ueli Maurer, and Bartosz Przydatek</div> <div class="venue"> Advances in Cryptology — ASIACRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1976, pp. 143–161, Dec 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/HiMaPr00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HiMaPr00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HiMaPr00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Linking Classical and Quantum Key Agreement: Is There “Bound Information”?</h3> <div class="authors">Nicolas Gisin and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — CRYPTO 2000, Lecture Notes in Computer Science, Springer-Verlag, pp. 482–500, Aug 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/GisWol00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/GisWol00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/GisWol00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Authentication Theory and Hypothesis Testing</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1350–1356, Jul 2000, Preliminary version: <a href="/publications/Maurer96c.html">[Maurer96c]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer00a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer00a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer00a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Bound Information: The Classical Analog to Bound Quantum Entanglement</h3> <div class="authors">Nicolas Gisin, Renato Renner, and Stefan Wolf</div> <div class="venue"> Proceedings of 3ecm, Progress in Mathematics, Birkhäuser Verlag, vol. 202, pp. 439–447, Jul 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/GiReWo00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/GiReWo00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/GiReWo00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Calculus of Conditional Independence and its Applications in Cryptography</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 243, Jun 2000. </div> <ul class="publinks"> <li><a href="/publications/Maurer00c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>An Efficient Test for the Possibility of Information-Theoretic Key Agreement Secure Against Active Adversaries</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 310, Jun 2000, Final version: <a href="/publications/Wolf00c.html">[Wolf00c]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf00a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Wolf00a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf00a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>From Weak to Strong Secrecy in Information-Theoretic Key Agreement</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 308, Jun 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol00a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol00a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol00a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Global Broadcast by Broadcasts Among Subsets of Players</h3> <div class="authors">Matthias Fitzi and Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 267, Jun 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/FitMau00b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FitMau00b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FitMau00b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Reducing Oblivious String Transfer to Universal Oblivious Transfer</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT 2000, IEEE, pp. 311, Jun 2000, Final version: <a href="/publications/Wolf00d.html">[Wolf00d]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf00b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Wolf00b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf00b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Receipt-Free Voting Based on Homomorphic Encryption</h3> <div class="authors">Martin Hirt and Kazue Sako</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 539–556, May 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/HirSak00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HirSak00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HirSak00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>From Partial Consistency to Global Broadcast</h3> <div class="authors">Matthias Fitzi and Ueli Maurer</div> <div class="venue"> Proc. 32nd ACM Symposium on Theory of Computing — STOC 2000, ACM, pp. 494–503, May 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/FitMau00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FitMau00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FitMau00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme</h3> <div class="authors">Ronald Cramer, Ivan Damgård, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 316–334, May 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/CrDaMa00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CrDaMa00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CrDaMa00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — EUROCRYPT 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1807, pp. 351–368, May 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol00b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol00b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol00b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Complexity of Verifiable Secret Sharing and Multiparty Computation</h3> <div class="authors">Ronald Cramer, Ivan Damgård, and Stefan Dziembowski</div> <div class="venue"> Proc. 32nd ACM Symposium on Theory of Computing — STOC 2000, ACM, pp. 325–334, May 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/CrDaDz00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CrDaDz00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CrDaDz00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Player Simulation and General Adversary Structures in Perfect Multiparty Computation</h3> <div class="authors">Martin Hirt and Ueli Maurer</div> <div class="venue"> Journal of Cryptology, Springer-Verlag, vol. 13, no. 1, pp. 31–60, Apr 2000, Extended abstract in Proc. 16th of ACM PODC '97. </div> <ul class="publinks"> <li> <a href="/publications/files/HirMau00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HirMau00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HirMau00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Reasoning About Public-Key Certification —- On Bindings Between Entities and Public Keys</h3> <div class="authors">Reto Kohlas and Ueli Maurer</div> <div class="venue"> IEEE Journal on Selected Areas in Communication, vol. 18, no. 4, pp. 561–570, Apr 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/KohMau00b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/KohMau00b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/KohMau00b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Special Aspects of Escrow-based E-Cash Systems</h3> <div class="authors">Lennart Meier</div> <div class="venue"> Master's thesis, Universität des Saarlandes, Saarbrücken, 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/Meier00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Meier00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Meier00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Confidence Valuation in a Public-key Infrastructure Based on Uncertain Evidence</h3> <div class="authors">Reto Kohlas and Ueli Maurer</div> <div class="venue"> Public Key Cryptography — PKC 2000, Lecture Notes in Computer Science, vol. 1751, pp. 93–112, Jan 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/KohMau00.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/KohMau00.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/KohMau00.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions</h3> <div class="authors">Ronald Cramer, Ivan Damgård, and Phillip MacKenzie</div> <div class="venue"> Public Key Cryptography — PKC 2000, Lecture Notes in Computer Science, Springer-Verlag, vol. 1751, pp. 354–372, Jan 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/CrDaMa00b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CrDaMa00b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CrDaMa00b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Diffie-Hellman Protocol</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Designs, Codes and Cryptography, Special Issue Public Key Cryptography, Kluwer Academic Publishers, vol. 19, no. 3, pp. 147–171, Jan 2000. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol00c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol00c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol00c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Simple and Effciently Verifiable Characterization of the Possibility of Information-Theoretic Key Agreement</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> 2000, This is the full version of <a href="/publications/Wolf00a.html">[Wolf00a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf00c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Wolf00c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf00c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Reducing String Oblivious Transfer to Universal Oblivious Transfer</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> 2000, This is the extended version of <a href="/publications/Wolf00b.html">[Wolf00b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf00d.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Wolf00d.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf00d.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1999"> <h2>Publications of 1999</h2> <article class="pubentry"> <h3>General Adversaries in Unconditional Multi-Party Computation</h3> <div class="authors">Matthias Fitzi, Martin Hirt, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — ASIACRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1716, pp. 232–246, Nov 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/FiHiMa99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FiHiMa99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FiHiMa99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Quantum Cryptography on Noisy Channels: Quantum Versus Classical Key-Agreement Protocols</h3> <div class="authors">Nicolas Gisin and Stefan Wolf</div> <div class="venue"> Physical Review Letters A, vol. 83, no. 20, pp. 4200–4203, Nov 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/GisWol99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/GisWol99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/GisWol99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Signature Schemes Based on the Strong RSA Assumption</h3> <div class="authors">Ronald Cramer and Victor Shoup</div> <div class="venue"> 5th ACM Conference on Computer and Communications Security — CCS '99, ACM, pp. 46–51, Nov 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/CraSho99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CraSho99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CraSho99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Byzantine Agreement Secure Against General Adversaries in the Dual Failure Model</h3> <div class="authors">Bernd Altmann, Matthias Fitzi, and Ueli Maurer</div> <div class="venue"> International Symposium on Distributed Computing — DISC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1693, pp. 123–137, Sep 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/AlFiMa99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/AlFiMa99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/AlFiMa99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Information-Theoretic Cryptography</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1666, pp. 47–64, Aug 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Pseudonym Systems</h3> <div class="authors">Anna Lysyanskaya, Ronald Rivest, Amit Sahai, and Stefan Wolf</div> <div class="venue"> Proceedings of Selected Areas in Cryptography — SAC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1758, pp. 184–199, Aug 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/LRSW99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/LRSW99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/LRSW99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Construction of the Dual Span Program</h3> <div class="authors">Serge Fehr</div> <div class="venue"> Manuscript, May 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/Fehr99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Fehr99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Fehr99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Multiparty Computations Secure Against an Adaptive Adversary</h3> <div class="authors">Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, and Tal Rabin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1592, pp. 311–326, May 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/CDDHR99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CDDHR99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CDDHR99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> SIAM Journal on Computing, vol. 28, no. 5, pp. 1689–1721, Apr 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol99b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol99b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol99b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unconditionally Secure Key Agreement and the Intrinsic Conditional Information</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 45, no. 2, pp. 499–514, Mar 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol99a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol99a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol99a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Reasoning about Public-key Certification — on Bindings Between Entities and Public Keys</h3> <div class="authors">Reto Kohlas and Ueli Maurer</div> <div class="venue"> Proceedings of Financial Cryptography — FC '99, Lecture Notes in Computer Science, Springer-Verlag, vol. 1648, pp. 86–103, Feb 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/KohMau99.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/KohMau99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/KohMau99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Information-Theoretically and Computationally Secure Key Agreement in Cryptography</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> PhD Thesis, ETH Zurich, 1999. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf99.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf99.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1998"> <h2>Publications of 1998</h2> <article class="pubentry"> <h3>Oblivious Transfer with a Memory-Bounded Receiver</h3> <div class="authors">Christian Cachin, Claude Crépeau, and Julien Marcil</div> <div class="venue"> Proceedings of the 39th Annual Symposium on Foundations of Computer Science — FOCS '98, IEEE, pp. 493–502, Nov 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/CaCrMa98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaCrMa98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaCrMa98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Strong Security Against Active Attacks in Information-Theoretic Secret-Key Agreement</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> Advances in Cryptology — ASIACRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1514, pp. 405–419, Oct 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf98b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Wolf98b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf98b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Byzantine Agreement Secure Against General Adversaries</h3> <div class="authors">Matthias Fitzi and Ueli Maurer</div> <div class="venue"> International Symposium on Distributed Computing — DISC '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1499, pp. 134–148, Sep 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/FitMau98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FitMau98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FitMau98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack</h3> <div class="authors">Ronald Cramer and Victor Shoup</div> <div class="venue"> Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 13–25, Aug 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/CraSho98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CraSho98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CraSho98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Trading Correctness for Privacy in Unconditional Multi-Party Computation</h3> <div class="authors">Matthias Fitzi, Martin Hirt, and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 121–136, Aug 1998, Corrected proceedings version. </div> <ul class="publinks"> <li> <a href="/publications/files/FiHiMa98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/FiHiMa98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/FiHiMa98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Zero-Knowledge for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?</h3> <div class="authors">Ronald Cramer and Ivan Damgård</div> <div class="venue"> Advances in Cryptology — CRYPTO '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1462, pp. 424–441, Aug 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/CraDam98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CraDam98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CraDam98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Diffie-Hellman, Decision Diffie-Hellman, and Discrete Logarithms</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '98, IEEE, pp. 327, Aug 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol98c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol98c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol98c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unconditional Security in Cryptography</h3> <div class="authors">Stefan Wolf</div> <div class="venue"> Lectures on Data Security: Modern Cryptology in Theory and Practice, Lecture Notes in Computer Science, Springer-Verlag, vol. 1561, pp. 217–250, Jul 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/Wolf98a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Wolf98a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Wolf98a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Lower Bounds on Generic Algorithms in Groups</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1403, pp. 72–84, May 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol98e.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol98e.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol98e.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Foundations of Oblivious Transfer</h3> <div class="authors">Christian Cachin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '98, Lecture Notes in Computer Science, Springer-Verlag, vol. 1403, pp. 361–374, May 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/Cachin98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Cachin98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Cachin98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem</h3> <div class="authors">Jan Camenisch</div> <div class="venue"> PhD Thesis, ETH Zurich, 1998, Reprint as vol. 2 of ETH Series in Information Security and Cryptography, ISBN 3-89649-286-1, Hartung-Gorre Verlag, Konstanz, 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/Cameni98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li><a href="/publications/Cameni98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Hardness of the Diffie-Hellman Decision Problem</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> 1998, Manuscript. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol98b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol98b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol98b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Span Programs over Rings and How to Share a Secret from a Module</h3> <div class="authors">Serge Fehr</div> <div class="venue"> Master's thesis, ETH Zurich, Institute for Theoretical Computer Science, 1998. </div> <ul class="publinks"> <li> <a href="/publications/files/Fehr98.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Fehr98.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Fehr98.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1997"> <h2>Publications of 1997</h2> <article class="pubentry"> <h3>A Secure and Optimally Efficient Multi-Authority Election Scheme</h3> <div class="authors">Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers</div> <div class="venue"> European Transactions on Telecommunications, vol. 8, no. 5, pp. 481–490, Sep 1997, Preliminary version: <a href="/publications/CrGeSc97b.html">[CrGeSc97b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/CrGeSc97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CrGeSc97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CrGeSc97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation</h3> <div class="authors">Martin Hirt and Ueli Maurer</div> <div class="venue"> Proc. 16th ACM Symposium on Principles of Distributed Computing — PODC '97, pp. 25–34, Aug 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/HirMau97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/HirMau97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/HirMau97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient Group Signature Schemes for Large Groups</h3> <div class="authors">Jan Camenisch and Markus Stadler</div> <div class="venue"> Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 410–424, Aug 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/CamSta97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CamSta97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CamSta97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Privacy Amplification Secure Against Active Adversaries</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 307–321, Aug 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol97b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol97b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol97b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Unconditional Security Against Memory-Bounded Adversaries</h3> <div class="authors">Christian Cachin and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pp. 292–306, Aug 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/CacMau97b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CacMau97b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CacMau97b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>How Much Memory is Needed to Win Infinite Games?</h3> <div class="authors">Stefan Dziembowski, Marcin Jurdzinski, and Igor Walukiewicz</div> <div class="venue"> 12th Annual IEEE Symposium on Logic in Computer Science — LICS '97, IEEE, pp. 99–110, Jun 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/DzJuWa97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/DzJuWa97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/DzJuWa97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Smoothing Probability Distributions and Smooth Entropy</h3> <div class="authors">Christian Cachin and Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '97, IEEE, Jun 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/CacMau97c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CacMau97c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CacMau97c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Intrinsic Conditional Mutual Information and Perfect Secrecy</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '97, IEEE, pp. 88, Jun 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol97c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol97c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol97c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Secure and Optimally Efficient Multi-Authority Election Scheme</h3> <div class="authors">Ronald Cramer, Rosario Gennaro, and Berry Schoenmakers</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 103–118, May 1997, Final version: <a href="/publications/CrGeSc97.html">[CrGeSc97]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/CrGeSc97b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CrGeSc97b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CrGeSc97b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficient and Generalized Group Signatures</h3> <div class="authors">Jan Camenisch</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 465–479, May 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/Cameni97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Cameni97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Cameni97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation</h3> <div class="authors">Ronald Cramer and Ivan Damgård</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 75–87, May 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/CraDam97b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CraDam97b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CraDam97b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 209–225, May 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Linear Zero-Knowledge: A Note on Efficient Zero-Knowledge Proofs and Arguments</h3> <div class="authors">Ronald Cramer and Ivan Damgård</div> <div class="venue"> Proc. 29th ACM Symposium on Theory of Computing — STOC '97, ACM, pp. 436–445, May 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/CraDam97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CraDam97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CraDam97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Smooth Entropy and Rényi Entropy</h3> <div class="authors">Christian Cachin</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1233, pp. 193–208, May 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/Cachin97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Cachin97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Cachin97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Linking Information Reconciliation and Privacy Amplification</h3> <div class="authors">Christian Cachin and Ueli Maurer</div> <div class="venue"> Journal of Cryptology, vol. 10, no. 2, pp. 97–110, Mar 1997, Preliminary version: <a href="/publications/CacMau94.html">[CacMau94]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/CacMau97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CacMau97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CacMau97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Proof Systems for General Statements about Discrete Logarithms</h3> <div class="authors">Jan Camenisch and Markus Stadler</div> <div class="venue"> Technical Report, no. 260, Institute for Theoretical Computer Science, ETH Zurich, Mar 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/CamSta97b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CamSta97b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CamSta97b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Digital Payment Systems with Passive Anonymity-Revoking Trustees</h3> <div class="authors">Jan Camenisch, Ueli Maurer, and Markus Stadler</div> <div class="venue"> Journal of Computer Security, vol. 5, no. 1, pp. 69–89, 1997, Preliminary version: <a href="/publications/CaMaSt96.html">[CaMaSt96]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/CaMaSt97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaMaSt97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaMaSt97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Entropy Measures and Unconditional Security in Cryptography</h3> <div class="authors">Christian Cachin</div> <div class="venue"> PhD Thesis, ETH Zurich, 1997, Reprint as vol. 1 of ETH Series in Information Security and Cryptography, ISBN 3-89649-185-7, Hartung-Gorre Verlag, Konstanz, 1997. </div> <ul class="publinks"> <li> <a href="/publications/files/Cachin97a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Cachin97a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Generic Complexity of Index-Search Problems and Applications to Cryptography</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> 1997, Manuscript. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol97.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol97.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol97.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1996"> <h2>Publications of 1996</h2> <article class="pubentry"> <h3>A Non-interactive Public-Key Distribution System</h3> <div class="authors">Ueli Maurer and Yacov Yacobi</div> <div class="venue"> Designs, Codes and Cryptography, vol. 9, no. 3, pp. 305–316, Nov 1996, Preliminary version: <a href="/publications/MauYac91.html">[MauYac91]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauYac96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauYac96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauYac96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Efficiency of One-time Digital Signatures</h3> <div class="authors">Daniel Bleichenbacher and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — ASIACRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1163, pp. 196–209, Nov 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/BleMau96b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BleMau96b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BleMau96b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards Characterizing when Information-Theoretic Key Agreement Is Possible</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — ASIACRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1163, pp. 196–209, Nov 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol96a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol96a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol96a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Bounded-Variable Fixpoint Queries are PSPACE-complete</h3> <div class="authors">Stefan Dziembowski</div> <div class="venue"> Computer Science Logic '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1258, pp. 89–105, Sep 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/Dziemb96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Dziemb96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Dziemb96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Digital Payment Systems with Passive Anonymity-Revoking Trustees</h3> <div class="authors">Jan Camenisch, Ueli Maurer, and Markus Stadler</div> <div class="venue"> European Symposium on Research in Computer Security — ESORICS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1146, pp. 33–43, Sep 1996, Final version: <a href="/publications/CaMaSt97.html">[CaMaSt97]</a>. </div> <ul class="publinks"> <li><a href="/publications/CaMaSt96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Modelling a Public-Key Infrastructure</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> European Symposium on Research in Computer Security — ESORICS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1146, pp. 325–350, Sep 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer96b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer96b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer96b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Diffie-Hellman Oracles</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Advances in Cryptology — CRYPTO '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1109, pp. 268–282, Aug 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol96c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol96c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol96c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generating ElGamal Signatures Without Knowing the Secret Key</h3> <div class="authors">Daniel Bleichenbacher</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1070, pp. 10–18, May 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/Bleich96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Bleich96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Bleich96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Publicly Verifiable Secret Sharing</h3> <div class="authors">Markus Stadler</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1070, pp. 190–199, May 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/Stadle96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Stadle96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Stadle96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Complexity of Breaking the Diffie-Hellman Protocol</h3> <div class="authors">Ueli Maurer and Stefan Wolf</div> <div class="venue"> Technical Report, no. 244, Institute for Theoretical Computer Science, ETH Zurich, Apr 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/MauWol96d.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauWol96d.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauWol96d.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>An Efficient Fair Payment System</h3> <div class="authors">Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler</div> <div class="venue"> 3rd ACM Conference on Computer and Communicatons Security — CCS '96, ACM, pp. 88–94, Mar 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/CaPiSt96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaPiSt96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaPiSt96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Unified and Generalized Treatment of Authentication Theory</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Proc. 13th Symposium on Theoretical Aspects of Computer Science — STACS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1046, pp. 387–398, Feb 1996, Final version: <a href="/publications/Maurer00a.html">[Maurer00a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer96c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer96c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer96c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Optimal Tree-based One-time Digital Signature Schemes</h3> <div class="authors">Daniel Bleichenbacher and Ueli Maurer</div> <div class="venue"> Proc. 13th Symposium on Theoretical Aspects of Computer Science — STACS '96, Lecture Notes in Computer Science, Springer-Verlag, vol. 1046, pp. 363–374, Feb 1996. </div> <ul class="publinks"> <li> <a href="/publications/files/BleMau96a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BleMau96a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BleMau96a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Calculus for Security Bootstrapping in Distributed Systems</h3> <div class="authors">Ueli Maurer and Pierre Schmid</div> <div class="venue"> Journal of Computer Security, vol. 4, no. 1, pp. 55–80, 1996, Preliminary version: <a href="/publications/MauSch94.html">[MauSch94]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauSch96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauSch96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauSch96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cryptographic Protocols for Revocable Privacy</h3> <div class="authors">Markus Stadler</div> <div class="venue"> PhD Thesis, ETH Zurich, 1996. </div> <ul class="publinks"> <li><a href="/publications/Stadle96a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Efficiency and Security of Cryptosystems Based on Number Theory</h3> <div class="authors">Daniel Bleichenbacher</div> <div class="venue"> PhD Thesis, ETH Zurich, 1996. </div> <ul class="publinks"> <li><a href="/publications/Bleich96a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Oracle Complexity of Factoring Integers</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Computational Complexity, vol. 5, no. 4, pp. 237–247, 1996, Preliminary version: <a href="/publications/Maurer92f.html">[Maurer92f]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer96.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer96.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer96.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1995"> <h2>Publications of 1995</h2> <article class="pubentry"> <h3>On-line Secret Sharing</h3> <div class="authors">Christian Cachin</div> <div class="venue"> Cryptography and Coding '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 1025, pp. 190–198, Dec 1995. </div> <ul class="publinks"> <li> <a href="/publications/files/Cachin95.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Cachin95.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Cachin95.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generalized Privacy Amplification</h3> <div class="authors">Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 41, no. 6, pp. 1915–1923, Nov 1995, Preliminary version: <a href="/publications/BBCM94.html">[BBCM94]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/BBCM95.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BBCM95.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BBCM95.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>New Information-Theoretic Bounds in Authentication Theory</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '95, IEEE, pp. 12, Sep 1995. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer95.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer95.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer95.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Faire Anonyme Zahlungssysteme</h3> <div class="authors">Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler</div> <div class="venue"> GISI '95, Informatik aktuell, Springer-Verlag, pp. 254–265, Sep 1995. </div> <ul class="publinks"> <li><a href="/publications/CaPiSt95.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Some Remarks on Lucas-Based Cryptosystems</h3> <div class="authors">Daniel Bleichenbacher, Wieb Bosma, and Arjen K. Lenstra</div> <div class="venue"> Advances in Cryptology — CRYPTO '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 386–396, Aug 1995. </div> <ul class="publinks"> <li> <a href="/publications/files/BlBoLe95.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BlBoLe95.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BlBoLe95.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Fair Blind Signatures</h3> <div class="authors">Markus Stadler, Jean-Marc Piveteau, and Jan Camenisch</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '95, Lecture Notes in Computer Science, Springer-Verlag, vol. 921, pp. 209–219, May 1995. </div> <ul class="publinks"> <li> <a href="/publications/files/StPiCa95.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/StPiCa95.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/StPiCa95.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Journal of Cryptology, vol. 8, no. 3, pp. 123–155, 1995, Preliminary version: <a href="/publications/Maurer89.html">[Maurer89]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer95a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer95a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer95a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Kryptologie: eine neuartige Anwendung der Mathematik</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Elemente der Mathematik, Birkhäuser Verlag, vol. 50, no. 3, pp. 89–106, 1995. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer95b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer95b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer95b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1994"> <h2>Publications of 1994</h2> <article class="pubentry"> <h3>A Calculus for Secure Channel Establishment in Open Networks</h3> <div class="authors">Ueli Maurer and Pierre Schmid</div> <div class="venue"> European Symposium on Research in Computer Security — ESORICS '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 875, pp. 175–192, Nov 1994, Final version: <a href="/publications/MauSch96.html">[MauSch96]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauSch94.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauSch94.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauSch94.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>An Efficient Electronic Payment System Protecting Privacy</h3> <div class="authors">Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler</div> <div class="venue"> European Symposium on Research in Computer Security — ESORICS '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 875, pp. 207–215, Nov 1994. </div> <ul class="publinks"> <li> <a href="/publications/files/CaPiSt94a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaPiSt94a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaPiSt94a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Directed Acyclic Graphs, One-way Functions and Digital Signatures</h3> <div class="authors">Daniel Bleichenbacher and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 963, pp. 75–82, Aug 1994. </div> <ul class="publinks"> <li> <a href="/publications/files/BleMau94.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/BleMau94.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/BleMau94.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 839, pp. 271–281, Aug 1994. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer94.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer94.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer94.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Generalized Privacy Amplification</h3> <div class="authors">Charles H. Bennett, Gilles Brassard, Claude Crépeau, and Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 350, Jun 1994, Final version: <a href="/publications/BBCM95.html">[BBCM95]</a>. </div> <ul class="publinks"> <li><a href="/publications/BBCM94.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>On the Secret-Key Rate of Binary Random Variables</h3> <div class="authors">Martin Gander and Ueli Maurer</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '94, IEEE, pp. 351, Jun 1994. </div> <ul class="publinks"> <li> <a href="/publications/files/GanMau94.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/GanMau94.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/GanMau94.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Blind Signatures Based on the Discrete Logarithm Problem</h3> <div class="authors">Jan Camenisch, Jean-Marc Piveteau, and Markus Stadler</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 950, pp. 428–432, May 1994. </div> <ul class="publinks"> <li> <a href="/publications/files/CaPiSt94b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/CaPiSt94b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/CaPiSt94b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Linking Information Reconciliation and Privacy Amplification</h3> <div class="authors">Christian Cachin and Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '94, Lecture Notes in Computer Science, Springer-Verlag, vol. 950, pp. 266–274, May 1994, Final version: <a href="/publications/CacMau97.html">[CacMau97]</a>. </div> <ul class="publinks"> <li><a href="/publications/CacMau94.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>The Strong Secret Key Rate of Discrete Random Triples</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Communication and Cryptography — Two Sides of One Tapestry, Kluwer Academic Publishers, pp. 271–285, 1994. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer94a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer94a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer94a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1993"> <h2>Publications of 1993</h2> <article class="pubentry"> <h3>The Role of Information Theory in Cryptography</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Cryptography and Coding '93, The Institute of Mathematics and its Applications, Southend-on-Sea, England, pp. 49–71, Dec 1993. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer93.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer93.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer93.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Protocols for Secret Key Agreement by Public Discussion Based on Common Information</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 740, pp. 461–470, Aug 1993, Final version: <a href="/publications/Maurer93a.html">[Maurer93a]</a>. </div> <ul class="publinks"> <li><a href="/publications/Maurer92g.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Secret Key Agreement by Public Discussion</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> IEEE Transactions on Information Theory, vol. 39, no. 3, pp. 733–742, May 1993, Preliminary version: <a href="/publications/Maurer92g.html">[Maurer92g]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer93a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer93a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer93a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cascade Ciphers: The Importance of Being First</h3> <div class="authors">Ueli Maurer and James L. Massey</div> <div class="venue"> Journal of Cryptology, vol. 6, no. 1, pp. 55–61, 1993, Preliminary version: <a href="/publications/MauMas90b.html">[MauMas90b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauMas93a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauMas93a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauMas93a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1992"> <h2>Publications of 1992</h2> <article class="pubentry"> <h3>Asymptotically-Tight Bounds on the Number of Cycles in Generalized de Bruijn-Good Graphs</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Discrete Applied Mathematics, vol. 37, pp. 421–436, Jul 1992. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer92c.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer92c.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer92c.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Remark on a Non-Interactive Public-Key Distribution System</h3> <div class="authors">Ueli Maurer and Yacov Yacobi</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 458–460, May 1992, This is a note on <a href="/publications/MauYac91.html">[MauYac91]</a>. See <a href="/publications/MauYac96.html">[MauYac96]</a> for the final version. </div> <ul class="publinks"> <li><a href="/publications/MauYac92.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 239–255, May 1992. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer92d.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer92d.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer92d.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Factoring with an Oracle</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '92, Lecture Notes in Computer Science, Springer-Verlag, vol. 658, pp. 429–436, May 1992, Final version: <a href="/publications/Maurer96.html">[Maurer96]</a>. </div> <ul class="publinks"> <li><a href="/publications/Maurer92f.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Some Number-theoretic Conjectures and Their Relation to the Generation of Cryptographic Primes</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Cryptography and Coding '92, Oxford University Press, pp. 173–191, Mar 1992. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer92e.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer92e.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer92e.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Universal Statistical Test for Random Bit Generators</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Journal of Cryptology, vol. 5, no. 2, pp. 89–105, 1992, Preliminary version: <a href="/publications/Maurer90b.html">[Maurer90b]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer92a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer92a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer92a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Journal of Cryptology, vol. 5, no. 1, pp. 53–66, 1992, Preliminary version: <a href="/publications/Maurer90a.html">[Maurer90a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer92b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer92b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer92b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1991"> <h2>Publications of 1991</h2> <article class="pubentry"> <h3>New Public-Key Schemes Based on Elliptic Curves over the Ring ${Z}_n$</h3> <div class="authors">Kenji Koyama, Ueli Maurer, Tatsuaki Okamoto, and Scott Vanstone</div> <div class="venue"> Advances in Cryptology — CRYPTO '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 576, pp. 252–266, Aug 1991. </div> <ul class="publinks"> <li> <a href="/publications/files/KMOV91.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/KMOV91.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/KMOV91.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Perfect Cryptographic Security from Partially Independent Channels</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Proc. 23rd ACM Symposium on Theory of Computing — STOC '91, ACM, pp. 561–572, Aug 1991. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer91b.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer91b.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer91b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>New Approaches to the Design of Self-Synchronizing Stream Ciphers</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 547, pp. 458–471, May 1991. </div> <ul class="publinks"> <li> <a href="/publications/files/Maurer91a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/Maurer91a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/Maurer91a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Non-Interactive Public-key Cryptography</h3> <div class="authors">Ueli Maurer and Yacov Yacobi</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '91, Lecture Notes in Computer Science, Springer-Verlag, vol. 547, pp. 498–507, Apr 1991, Final version: <a href="/publications/MauYac96.html">[MauYac96]</a>, see also the note in <a href="/publications/MauYac92.html">[MauYac92]</a>. </div> <ul class="publinks"> <li><a href="/publications/MauYac91.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Local Randomness in Pseudo-Random Sequences</h3> <div class="authors">Ueli Maurer and James L. Massey</div> <div class="venue"> Journal of Cryptology, vol. 4, no. 2, pp. 135–149, 1991, Preliminary version: <a href="/publications/MauMas89.html">[MauMas89]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauMas91a.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauMas91a.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauMas91a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1990"> <h2>Publications of 1990</h2> <article class="pubentry"> <h3>A Universal Statistical Test for Random Bit Generators</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — CRYPTO '90, Lecture Notes in Computer Science, Springer-Verlag, vol. 537, pp. 409–420, Aug 1990, Final version: <a href="/publications/Maurer92a.html">[Maurer92a]</a>. </div> <ul class="publinks"> <li><a href="/publications/Maurer90b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>A Provably-Secure Strongly-Randomized Cipher</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '90, Lecture Notes in Computer Science, Springer-Verlag, vol. 473, pp. 361–373, May 1990, Final version: <a href="/publications/Maurer92b.html">[Maurer92b]</a>. </div> <ul class="publinks"> <li><a href="/publications/Maurer90a.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Cascade Ciphers: The Importance of Being First</h3> <div class="authors">Ueli Maurer and James L. Massey</div> <div class="venue"> IEEE International Symposium on Information Theory — ISIT '90, IEEE, pp. 118, Jan 1990, Final version: <a href="/publications/MauMas93a.html">[MauMas93a]</a>. </div> <ul class="publinks"> <li><a href="/publications/MauMas90b.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1989"> <h2>Publications of 1989</h2> <article class="pubentry"> <h3>Perfect Local Randomness in Pseudo-Random Sequences</h3> <div class="authors">Ueli Maurer and James L. Massey</div> <div class="venue"> Advances in Cryptology — CRYPTO '89, Lecture Notes in Computer Science, Springer-Verlag, vol. 435, pp. 100–112, Aug 1989, Final version: <a href="/publications/MauMas91a.html">[MauMas91a]</a>. </div> <ul class="publinks"> <li> <a href="/publications/files/MauMas89.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MauMas89.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MauMas89.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> <article class="pubentry"> <h3>Fast Generation of RSA-Moduli with Almost Maximal Diversity</h3> <div class="authors">Ueli Maurer</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '89, Lecture Notes in Computer Science, Springer-Verlag, vol. 434, pp. 636–647, Apr 1989, Final version: <a href="/publications/Maurer95a.html">[Maurer95a]</a>. </div> <ul class="publinks"> <li><a href="/publications/Maurer89.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> <section id="y1987"> <h2>Publications of 1987</h2> <article class="pubentry"> <h3>Non-Expanding, Key-Minimal, Robustly-Perfect, Linear and Bilinear Ciphers</h3> <div class="authors">James L. Massey, Ueli Maurer, and Muzhong Wang</div> <div class="venue"> Advances in Cryptology — EUROCRYPT '87, Lecture Notes in Computer Science, Springer-Verlag, vol. 304, pp. 237–247, Apr 1987. </div> <ul class="publinks"> <li> <a href="/publications/files/MaMaWa87.pdf"><i class="far fa-file-pdf"></i> PDF</a> </li> <li> <a href="/publications/files/MaMaWa87.ps"><i class="far fa-file-powerpoint"></i> PS</a> </li> <li><a href="/publications/MaMaWa87.html"><i class="far fa-list-alt"></i> Details</a></li> </ul> </article> </section> </main> <footer> <section id="affils" class="darkgrey"> <h2>Affiliations</h2> <nav> <ul> <li><a href="https://ti.inf.ethz.ch/">Institute of Theoretical Computer Science</a></li> <li><a href="https://inf.ethz.ch/">Department of Computer Science</a></li> <li><a href="https://www.ethz.ch/">ETH Zürich</a></li> </ul> </nav> </section> <div id="smallprint"> <a href="https://zisc.ethz.ch/" class="optional"><img src="/assets/images/zisc.png" alt="ZISC – Zürich Information Security and Privacy Center"></a> <div> <a href="https://ethz.ch/en/footer/disclaimer-copyright.html">© 2025 – <span class="optional">Information Security and Cryptography Group, </span>ETH Zürich</a> </div> <div> <span><a href="https://ethz.ch/en/footer/disclaimer-copyright.html">Disclaimer</a></span> <span><a href="https://ethz.ch/en/footer/data-protection.html">Data protection</a></span> <span><a href="/imprint.html">Imprint</a></span> </div> </div> </footer> </div> </body> </html>

CINXE.COM

Publications - Information Security and Cryptography Research Group - ETH Zürich