Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID42nd EUROCRYPT 2023: Lyon, France - Part II
- Carmit Hazay
, Martijn Stam:
Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14005, Springer 2023, ISBN 978-3-031-30616-7
Multi-party Computation
- Marshall Ball, Hanjun Li, Huijia Lin, Tianren Liu:
New Ways to Garble Arithmetic Circuits. 3-34 - Hongrui Cui, Xiao Wang, Kang Yang, Yu Yu:
Actively Secure Half-Gates with Minimum Overhead Under Duplex Networks. 35-67 - Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Black-Box Reusable NISC with Random Oracles. 68-97 - Rex Fernando, Aayush Jain, Ilan Komargodski:
Maliciously-Secure MrNISC in the Plain Model. 98-128 - Ivan Damgård, Divya Ravi, Luisa Siniscalchi, Sophia Yakoubov:
Minimizing Setup in Broadcast-Optimal Two Round MPC. 129-158 - Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear-Communication Secure Multiparty Computation Does Not Require FHE. 159-189 - Benny Applebaum, Niv Konstantini:
Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead. 190-219 - Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, Yifan Song, Chenkai Weng:
SuperPack: Dishonest Majority MPC with Constant Online Communication. 220-250 - Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. 251-281 - Hamza Abusalah, Valerio Cini:
An Incremental PoSW for General Weight Distributions. 282-311
(Zero-Knowledge) Proofs
- Chaya Ganesh, Yashvanth Kondi, Claudio Orlandi, Mahak Pancholi, Akira Takahashi, Daniel Tschudi:
Witness-Succinct Universally-Composable SNARKs. 315-346 - Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. 347-378 - Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner:
Proof-Carrying Data from Arithmetized Random Oracles. 379-404 - Andrea Basso, Giulio Codogni, Deirdre Connolly, Luca De Feo, Tako Boris Fouotsa, Guido Maria Lido, Travis Morrison, Lorenz Panny, Sikhar Patranabis, Benjamin Wesolowski:
Supersingular Curves You Can Trust. 405-437 - Mathias Hall-Andersen, Jesper Buus Nielsen:
On Valiant's Conjecture - Impossibility of Incrementally Verifiable Computation from Random Oracles. 438-469 - Yael Tauman Kalai, Alex Lombardi, Vinod Vaikuntanathan:
SNARGs and PPAD Hardness from the Decisional Diffie-Hellman Assumption. 470-498 - Binyi Chen, Benedikt Bünz, Dan Boneh, Zhenfei Zhang:
HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates. 499-530 - Quang Dao, Paul Grubbs:
Spartan and Bulletproofs are Simulation-Extractable (for Free!). 531-562 - Varun Narayanan, Vinod M. Prabhakaran, Neha Sangwan, Shun Watanabe:
Complete Characterization of Broadcast and Pseudo-signatures from Correlations. 563-593 - Markulf Kohlweiss, Anna Lysyanskaya, An Nguyen:
Privacy-Preserving Blueprints. 594-625
a service of 
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 2024-05-31 18:51 CEST 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:
