Ulteriori informazioni
The four-volume set, LNCS 12825, LNCS 12826, LNCS 12827, and LNCS 12828, constitutes the refereed proceedings of the 41st Annual International Cryptology Conference, CRYPTO 2021. Crypto has traditionally been held at UCSB every year, but due to the COVID-19 pandemic it was an online event in 2021.The 103 full papers presented in the proceedings were carefully reviewed and selected from a total of 426 submissions. The papers are organized in the following topical sections:
Part I: Award Papers; Signatures; Quantum Cryptography; Succinct Arguments.
Part II: Multi-Party Computation; Lattice Cryptography; and Lattice Cryptanalysis.
Part III: Models; Applied Cryptography and Side Channels; Cryptanalysis; Codes and Extractors; Secret Sharing.
Part IV: Zero Knowledge; Encryption++; Foundations; Low-Complexity Cryptography; Protocols.
Sommario
Models.- A Rational Protocol Treatment of 51% Attacks.- MoSS: Modular Security Specifications Framework.- Tight State-Restoration Soundness in the Algebraic Group Model.- Separating Adaptive Streaming from Oblivious Streaming using the Bounded Storage Model.- Applied Cryptography and Side Channels.- Provable Security Analysis of FIDO2-. SSE and SSD: Page-Efficient Searchable Symmetric Encryption.- Towards Tight Random Probing Security.- Secure Wire Shuffling in the Probing Model.- Cryptanalysis.- Differential-Linear Cryptanalysis from an Algebraic Perspective.- Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks.- Revisiting the Security of DbHtS MACs: Beyond-Birthday-Bound in the Multi-User Setting.- Thinking Outside the Superbox.- Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques.- The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3.- Improved torsion-point attacks on SIDH variants.- Codes and Extractors.- Smoothing Out Binary Linear Codes and Worst-case Sub-exponential Hardness for LPN.- Silver: Silent VOLE and Oblivious Transfer from Hardness of Decoding Structured LDPC Codes.- Non-Malleable Codes for Bounded Parallel-Time Tampering.- Improved Computational Extractors and their Applications.- Adaptive Extractors and their Application to Leakage Resilient Secret Sharing.- Secret Sharing.- Upslices, Downslices, and Secret-Sharing with Complexity of 1.5n.- Asymptotically-Good Arithmetic Secret Sharing over /p with Strong Multiplication and Its Applications to Efficient MPC.- Large Message Homomorphic Secret Sharing from DCR and Applications.- Traceable Secret Sharing and Applications.- Quadratic Secret Sharing and Conditional Disclosure of Secrets.- Constructing Locally Leakage-resilient Linear Secret-sharing Schemes.
