default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20th TCC 2022: Chicago, IL, USA - Part II
- Eike Kiltz
, Vinod Vaikuntanathan:
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II. Lecture Notes in Computer Science 13748, Springer 2022, ISBN 978-3-031-22364-8
Encryption
- Yevgeniy Dodis, Daniel Jost, Harish Karthikeyan:
Forward-Secure Encryption with Fast Forwarding. 3-32 - Pedro Branco, Nico Döttling, Jesko Dujmovic:
Rate-1 Incompressible Encryption from Standard Assumptions. 33-69 - Adi Akavia, Craig Gentry, Shai Halevi, Margarita Vald:
Achievable CCA2 Relaxation for Homomorphic Encryption. 70-99
Multi-party Computation I
- Benny Applebaum, Eliran Kachlon, Arpita Patra:
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). 103-120 - Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear Secure Computation from New Assumptions. 121-150 - Ian McQuoid, Mike Rosulek, Jiayu Xu:
How to Obfuscate MPC Inputs. 151-180 - Saikrishna Badrinarayanan, Sikhar Patranabis, Pratik Sarkar:
Statistical Security in Two-Party Computation Revisited. 181-210
Protocols: Key Agreement and Commitments
- Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler:
On the Worst-Case Inefficiency of CGKA. 213-243 - Venkata Koppula, Brent Waters, Mark Zhandry:
Adaptive Multiparty NIKE. 244-273 - Dario Catalano, Dario Fiore, Rosario Gennaro, Emanuele Giunta:
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups. 274-299 - Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi:
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. 300-329
Theory I: Sampling and Friends
- Nathan Geier:
A Tight Computational Indistinguishability Bound for Product Distributions. 333-347 - Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Secure Sampling with Sublinear Communication. 348-377 - Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Secure Non-interactive Simulation from Arbitrary Joint Distributions. 378-407 - Kaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran:
Secure Non-interactive Reducibility is Decidable. 408-437
Multi-party Computation II
- Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. 441-469 - Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. 470-501 - Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran:
SCALES - MPC with Small Clients and Larger Ephemeral Servers. 502-531 - Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. 532-561
Lattices
- Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Homogeneous CLWE. 565-592 - Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. 593-622 - Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. 623-652 - George Lu, Brent Waters:
How to Sample a Discrete Gaussian (and more) from a Random Oracle. 653-682
Anonymity, Verifiability and Robustness
- Thomas Agrikola, Geoffroy Couteau, Sven Maier:
Anonymous Whistleblowing over Authenticated Channels. 685-714 - Megumi Ando, Miranda Christ, Anna Lysyanskaya, Tal Malkin:
Poly Onions: Achieving Anonymity in the Presence of Churn. 715-746 - Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal:
The Price of Verifiability: Lower Bounds for Verifiable Random Functions. 747-776 - Moni Naor, Noa Oved:
Bet-or-Pass: Adversarially Robust Bloom Filters. 777-808
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-03-01 15:19 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:
