default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd ITC 2021
- Stefano Tessaro:
2nd Conference on Information-Theoretic Cryptography, ITC 2021, July 23-26, 2021, Virtual Conference. LIPIcs 199, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-197-9 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Guru-Vamsi Policharla, Manoj Prabhakaran, Rajeev Raghunath, Parjanya Vyas:
Group Structure in Correlations and Its Applications in Cryptography. 1:1-1:23 - Ivan Bjerre Damgård, Boyang Li, Nikolaj Ignatieff Schwartzbach:
More Communication Lower Bounds for Information-Theoretic MPC. 2:1-2:18 - Gal Arnon
, Guy N. Rothblum:
On Prover-Efficient Public-Coin Emulation of Interactive Proofs. 3:1-3:15 - Benny Applebaum, Eyal Golombek:
On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs. 4:1-4:23 - Samuel Dittmer, Yuval Ishai, Rafail Ostrovsky:
Line-Point Zero Knowledge and Its Applications. 5:1-5:24 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Mor Weiss:
ZK-PCPs from Leakage-Resilient Secret Sharing. 6:1-6:21 - Brett Hemenway Falk, Rafail Ostrovsky:
Secure Merge with O(n log log n) Secure Operations. 7:1-7:29 - T.-H. Hubert Chan, Elaine Shi, Wei-Kai Lin, Kartik Nayak:
Perfectly Oblivious (Parallel) RAM Revisited, and Improved Constructions. 8:1-8:23 - Megumi Ando, Anna Lysyanskaya, Eli Upfal:
On the Complexity of Anonymous Communication Through Public Networks. 9:1-9:25 - Ivan Bjerre Damgård, Kasper Green Larsen, Sophia Yakoubov:
Broadcast Secret-Sharing, Bounds and Applications. 10:1-10:20 - Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar, Jenit Tomy:
Locally Reconstructable Non-Malleable Secret Sharing. 11:1-11:19 - Marshall Ball, Alper Çakan, Tal Malkin:
Linear Threshold Secret-Sharing with Binary Reconstruction. 12:1-12:22 - Yevgeniy Dodis, Kevin Yeo:
Doubly-Affine Extractors, and Their Applications. 13:1-13:23 - Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie:
Online Linear Extractors for Independent Sources. 14:1-14:14 - Luke Demarest, Benjamin Fuller, Alexander Russell:
Code Offset in the Exponent. 15:1-15:23 - Alexander R. Block, Simina Brânzei, Hemanta K. Maji, Himanshi K. Mehta, Tamalika Mukherjee, Hai H. Nguyen:
P4-free Partition and Cover Numbers & Applications. 16:1-16:25 - Kenji Yasunaga:
Replacing Probability Distributions in Security Games via Hellinger Distance. 17:1-17:15 - Yue Gao, Or Sheffet:
Differentially Private Approximations of a Convex Hull in Low Dimensions. 18:1-18:16 - Shumo Chu, Danyang Zhuo, Elaine Shi, T.-H. Hubert Chan:
Differentially Oblivious Database Joins: Overcoming the Worst-Case Curse of Fully Oblivious Algorithms. 19:1-19:24 - Akinori Kawachi, Harumichi Nishimura:
Communication Complexity of Private Simultaneous Quantum Messages Protocols. 20:1-20:19 - Christian Majenz, Chanelle Matadah Manfouo, Maris Ozols:
Quantum-Access Security of the Winternitz One-Time Signature Scheme. 21:1-21:22 - Jeremiah Blocki, Seunghoon Lee, Samson Zhou:
On the Security of Proofs of Sequential Work in a Post-Quantum World. 22:1-22:27 - Xinze Li, Qiang Tang, Zhenfeng Zhang:
Fooling an Unbounded Adversary with a Short Key, Repeatedly: The Honey Encryption Perspective. 23:1-23:21 - Yevgeniy Dodis, Dmitry Khovratovich, Nicky Mouha, Mridul Nandi:
T₅: Hashing Five Inputs with Three Compression Calls. 24:1-24:23 - Gwangbae Choi, F. Betül Durak, Serge Vaudenay:
Post-Compromise Security in Self-Encryption. 25:1-25:23 - Gili Schul-Ganz, Gil Segev:
Generic-Group Identity-Based Encryption: A Tight Impossibility Result. 26:1-26:23
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-01-02 18:00 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:
