default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID18th TCC 2020: Durham, NC, USA
- Rafael Pass, Krzysztof Pietrzak:
Theory of Cryptography - 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020, Proceedings, Part II. Lecture Notes in Computer Science 12551, Springer 2020, ISBN 978-3-030-64377-5 - Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner:
Recursive Proof Composition from Accumulation Schemes. 1-18 - Jonathan Bootle
, Alessandro Chiesa, Jens Groth:
Linear-Time Arguments with Sublinear Verification from Tensor Codes. 19-46 - Alessandro Chiesa, Eylon Yogev:
Barriers for Succinct Arguments in the Random Oracle Model. 47-76 - Gili Schul-Ganz, Gil Segev:
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction. 77-107 - Guy N. Rothblum, Ron D. Rothblum:
Batch Verification and Proofs of Proximity with Polylog Overhead. 108-138 - Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan:
Batch Verification for Statistical Zero Knowledge Proofs. 139-167 - Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. 168-197 - Alexander Bienstock, Yevgeniy Dodis, Paul Rösler:
On the Price of Concurrency in Group Ratcheting Protocols. 198-228 - Ivan Damgård, Helene Haagh, Rebekah Mercer, Anca Nitulescu, Claudio Orlandi, Sophia Yakoubov:
Stronger Security and Constructions of Multi-designated Verifier Signatures. 229-260 - Joël Alwen, Sandro Coretti, Daniel Jost, Marta Mularczyk:
Continuous Group Key Agreement with Active Security. 261-290 - Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Round Optimal Secure Multiparty Computation from Minimal Assumptions. 291-319 - James Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee:
Reusable Two-Round MPC from DDH. 320-348 - Fabrice Benhamouda, Huijia Lin:
Mr NISC: Multiparty Reusable Non-Interactive Secure Computation. 349-378 - Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. 379-409 - Ran Canetti, Oxana Poburinnaya:
Towards Multiparty Computation Withstanding Coercion of All Parties. 410-438 - Chen-Da Liu-Zhang, Ueli Maurer:
Synchronous Constructive Cryptography. 439-472 - Marshall Ball, Elette Boyle, Ran Cohen, Lisa Kohl, Tal Malkin, Pierre Meyer, Tal Moran:
Topology-Hiding Communication from Minimal Assumptions. 473-501 - Huijia Lin, Tianren Liu, Hoeteck Wee:
Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More. 502-531 - Dakshita Khurana, Muhammad Haris Mughees:
On Statistical Security in Two-Party Computation. 532-561 - Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). 562-594 - Dana Dachman-Soled:
Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures. 595-620 - Bar Alon, Ran Cohen, Eran Omri, Tom Suad:
On the Power of an Honest Majority in Three-Party Computation Without Broadcast. 621-651 - Ignacio Cascudo, Jaron Skovsted Gundersen:
A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity. 652-682 - Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. 683-712
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-02-15 00:04 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:
