default search action
41st CRYPTO 2021: Virtual Event - Part IV
- Tal Malkin
, Chris Peikert
Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part IV. Lecture Notes in Computer Science 12828, Springer 2021, ISBN 978-3-030-84258-1
Zero Knowledge
- Hanwen Feng, Qiang Tang:
Witness Authenticating NIZKs and Applications. 3-33 - Xiao Liang
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs. 34-64 - Thomas Attema
Compressing Proofs of k-Out-Of-n Partial Knowledge. 65-91 - Carsten Baum
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. 92-122 - Alexander R. Block
Time- and Space-Efficient Arguments from Groups of Unknown Order. 123-152
Encryption++
- Hoeteck Wee:
Broadcast Encryption with Size N1/3 and More from k-Lin. 155-178 - Yuyu Wang
Fine-Grained Secure Attribute-Based Encryption. 179-207 - Shweta Agrawal, Rishab Goyal, Junichi Tomida:
Multi-input Quadratic Functional Encryption from Pairings. 208-238 - Shweta Agrawal, Monosij Maitra, Narasimha Sai Vempati, Shota Yamada:
Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE. 239-269 - Yi Wang, Rongmao Chen, Guomin Yang
Receiver-Anonymity in Rerandomizable RCCA-Secure Cryptosystems Resolved. 270-300
Foundations
- Mark Zhandry:
White Box Traitor Tracing. 303-333 - Yilei Chen, Alex Lombardi, Fermi Ma, Willy Quach:
Does Fiat-Shamir Require a Cryptographic Hash Function? 334-363 - Thomas Kerber, Aggelos Kiayias, Markulf Kohlweiss
Composition with Knowledge Assumptions. 364-393 - Arka Rai Choudhuri
Non-interactive Batch Arguments for NP from Standard Assumptions. 394-423 - Willy Quach, Brent Waters, Daniel Wichs:
Targeted Lossy Functions and Applications. 424-453 - Tianren Liu, Stefano Tessaro, Vinod Vaikuntanathan:
The t-wise Independence of Substitution-Permutation Networks. 454-483
Low-Complexity Cryptography
- Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Peter Scholl:
Low-Complexity Weak Pseudorandom Functions in $\mathtt {AC}0[\mathtt {MOD}2]$. 487-516 - Itai Dinur, Steven Goldfeder, Tzipora Halevi, Yuval Ishai, Mahimna Kelkar, Vivek Sharma, Greg Zaverucha:
MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications. 517-547 - Yevgeniy Dodis, Siyao Guo, Noah Stephens-Davidowitz, Zhiye Xie:
No Time to Hash: On Super-Efficient Entropy Accumulation. 548-576
Protocols
- Ilan Komargodski, Wei-Kai Lin:
A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). 579-609 - Gilad Asharov
Oblivious RAM with Worst-Case Logarithmic Overhead. 610-640 - Elaine Shi, Waqar Aqeel, Balakrishnan Chandrasekaran, Bruce M. Maggs:
Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time. 641-669 - Shuai Han
Authenticated Key Exchange and Signatures with Tight Security in the Standard Model. 670-700 - Yanqi Gu
KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange. 701-730
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-12-15 01:30 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: