default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID19th TCC 2021: Raleigh, NC, USA - Part II
- Kobbi Nissim, Brent Waters:
Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part II. Lecture Notes in Computer Science 13043, Springer 2021, ISBN 978-3-030-90452-4 - Jonathan Lee:
Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments. 1-34 - Annick Chopard, Martin Hirt, Chen-Da Liu-Zhang:
On Communication-Efficient Asynchronous MPC with Adaptive Security. 35-65 - Ittai Abraham, Gilad Asharov
, Avishay Yanai:
Efficient Perfectly Secure Computation with Optimal Resilience. 66-96 - Aarushi Goel, Abhishek Jain, Manoj Prabhakaran, Rajeev Raghunath:
On Communication Models and Best-Achievable Security in Two-Round MPC. 97-128 - Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof:
Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. 129-161 - Vipul Goyal, Elisaweta Masserova, Bryan Parno, Yifan Song:
Blockchains Enable Non-interactive MPC. 162-193 - Léonard Assouline, Tianren Liu:
Multi-party PSM, Revisited: - Improved Communication and Unbalanced Communication. 194-223 - Shweta Agrawal, Rishab Goyal, Junichi Tomida:
Multi-Party Functional Encryption. 224-255 - Lalita Devadas, Willy Quach, Vinod Vaikuntanathan, Hoeteck Wee, Daniel Wichs:
Succinct LWE Sampling, Random Polynomials, and Obfuscation. 256-287 - Hoeteck Wee:
ABE for DFA from LWE Against Bounded Collusions, Revisited. 288-309 - Itai Dinur, Ben Hasson:
Distributed Merkle's Puzzles. 310-332 - Gianluca Brian, Antonio Faonio, Daniele Venturi:
Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity. 333-364 - Jiaxin Guan, Mark Zhandry:
Disappearing Cryptography in the Bounded Storage Model. 365-396 - Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak, Michelle Yeo:
Trojan-Resilience Without Cryptography. 397-428 - Chris Brzuska, Geoffroy Couteau, Pihla Karanko, Felix Rohrbach:
On Derandomizing Yao's Weak-to-Strong OWF Construction. 429-456 - Noam Mazor, Jiapeng Zhang:
Simple Constructions from (Almost) Regular One-Way Functions. 457-485 - Chethan Kamath, Karen Klein, Krzysztof Pietrzak:
On Treewidth, Separators and Yao's Garbling. 486-517 - Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. 518-549 - Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Michael Walter:
The Cost of Adaptivity in Security Games on Graphs. 550-581 - Salil P. Vadhan, Tianhao Wang:
Concurrent Composition of Differential Privacy. 582-604 - David Lanzenberger, Ueli Maurer:
Direct Product Hardness Amplification. 605-625 - Christian Badertscher, Julia Hesse, Vassilis Zikas:
On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger. 626-657 - Dana Dachman-Soled, Huijing Gong, Hunter Kippen, Aria Shahverdi:
BKW Meets Fourier New Algorithms for LPN with Sparse Parities. 658-688 - Hanwen Feng, Qiang Tang:
Computational Robust (Fuzzy) Extractors for CRS-Dependent Sources with Minimal Min-entropy. 689-717 - Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody:
Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions. 718-750
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-10-31 20:23 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:
