default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd ITC 2022: Cambridge, MA, USA
- Dana Dachman-Soled
:
3rd Conference on Information-Theoretic Cryptography, ITC 2022, Cambridge, MA, USA, July 5-7, 2022. LIPIcs 230, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-238-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Reo Eriguchi, Kaoru Kurosawa, Koji Nuida:
Multi-Server PIR with Full Error Detection and Limited Error Correction. 1:1-1:20 - Kazuhiko Minematsu:
Property-Preserving Hash Functions and Combinatorial Group Testing. 2:1-2:14 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
Protecting Distributed Primitives Against Leakage: Equivocal Secret Sharing and More. 3:1-3:24 - Nico Döttling, Jesko Dujmovic:
Maliciously Circuit-Private FHE from Information-Theoretic Principles. 4:1-4:21 - Varun Madathil, Chris Orsini, Alessandra Scafuro, Daniele Venturi:
From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic. 5:1-5:20 - Pavel Hubácek, L'ubica Jancová, Veronika Králová:
On the Distributed Discrete Logarithm Problem with Preprocessing. 6:1-6:19 - Marshall Ball, Tim Randolph:
A Note on the Complexity of Private Simultaneous Messages with Many Parties. 7:1-7:12 - Peter Scholl, Mark Simkin, Luisa Siniscalchi:
Multiparty Computation with Covert Security and Public Verifiability. 8:1-8:13 - Sandro Coretti, Yevgeniy Dodis, Harish Karthikeyan, Noah Stephens-Davidowitz, Stefano Tessaro:
On Seedless PRNGs and Premature Next. 9:1-9:20 - Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, Daniel Wichs:
Refuting the Dream XOR Lemma via Ideal Obfuscation and Resettable MPC. 10:1-10:21 - Chandranan Dhar, Yevgeniy Dodis, Mridul Nandi:
Revisiting Collision and Local Opening Analysis of ABR Hash. 11:1-11:22 - Lior Rotem, Gil Segev:
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. 12:1-12:16 - Lior Rotem:
Revisiting the Uber Assumption in the Algebraic Group Model: Fine-Grained Bounds in Hidden-Order Groups and Improved Reductions in Bilinear Groups. 13:1-13:13 - Nishanth Chandran, Pouyan Forghani, Juan A. Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas:
Universally Composable Almost-Everywhere Secure Computation. 14:1-14:25 - Gilad Asharov, Ran Cohen, Oren Shochat:
Static vs. Adaptive Security in Perfect MPC: A Separation and the Adaptive Security of BGW. 15:1-15:16 - Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, Albert Yu:
Tight Estimate of the Local Leakage Resilience of the Additive Secret-Sharing Scheme & Its Consequences. 16:1-16:19 - Elette Boyle, Niv Gilboa, Yuval Ishai, Victor I. Kolobov:
Information-Theoretic Distributed Point Functions. 17:1-17:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-08 09:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
