Advances in cryptology -- CRYPTO 2023 : Part II / 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings. Helena Handschuh, Anna Lysyanskaya, editors.

The five-volume set, LNCS 14081, 140825, 14083, 14084, and 14085 constitutes the refereed proceedings of the 43rd Annual International Cryptology Conference, CRYPTO 2023. The conference took place at Santa Barbara, USA, during August 19-24, 2023. The 124 full papers presented in the proceedings were...

Full description

Saved in:
Bibliographic Details
Corporate Author: CRYPTO (Conference) Santa Barbara, Calif.)
Other Authors: Handschuh, Helena (Editor), Lysyanskaya, Anna (Editor)
Format: eBook
Language:English
Published: Cham : Springer, 2023.
Series:Lecture notes in computer science ; 14082.
Subjects:
Online Access:Click for online access
Description
Summary:The five-volume set, LNCS 14081, 140825, 14083, 14084, and 14085 constitutes the refereed proceedings of the 43rd Annual International Cryptology Conference, CRYPTO 2023. The conference took place at Santa Barbara, USA, during August 19-24, 2023. The 124 full papers presented in the proceedings were carefully reviewed and selected from a total of 479 submissions. The papers are organized in the following topical sections: Part I: Consensus, secret sharing, and multi-party computation; Part II: Succinctness; anonymous credentials; new paradigms and foundations; Part III: Cryptanalysis; side channels; symmetric constructions; isogenies; Part IV: Faster fully homomorphic encryption; oblivious RAM; obfuscation; secure messaging; functional encryption; correlated pseudorandomness; proof systems in the discrete-logarithm setting.
Item Description:Includes author index.
Physical Description:1 online resource (xix, 792 pages) : illustrations (some color).
Bibliography:References -- Orbweaver: Succinct Linear Functional Commitments from Lattices -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 1.3 Technical Overview -- 2 Preliminaries -- 2.1 Functional Commitments -- 2.2 Sampling Algorithm -- 2.3 Cryptographic Assumptions -- 3 Cryptanalysis of k-P-R-ISIS -- 4 Orbweaver: Linear Map Commitments for rings -- 4.1 Extensions -- 5 Linear Map Commitments for ZM -- 5.1 Polynomial Commitments for integers mod p -- 6 Evaluation -- 6.1 Optimizations -- 6.2 Proof and CRS Sizes -- References -- Non-interactive Universal Arguments -- 1 Introduction -- 1.1 Results -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Homomorphic Encryption -- 2.2 Non-interactive Arguments for Deterministic Computations -- 2.3 Incrementally Verifiable Computation -- 2.4 Average-Case Puzzles -- 3 Universal Lifting -- 3.1 Incrementally Verifiable Computation Lifting -- 4 Constructing Average-Case Puzzles -- 4.1 Worst-Case Hardness Assumptions -- 4.2 Average-Case Puzzles from FHE -- References -- Succinct Arguments for RAM Programs via Projection Codes -- 1 Introduction -- 1.1 Black-Box Succincts Argument for RAM Programs -- 1.2 Projection Codes -- 1.3 Related Work -- 2 Overview of Techniques -- 2.1 Projection Codes -- 2.2 Holographic PCPs for RAM Programs -- 2.3 Succinct Arguments for RAM Programs -- 3 Preliminaries -- 3.1 Model of Computation -- 3.2 Encoding Scheme -- 3.3 Probabilistically Checkable Proofs of Proximity (PCPPs) -- 4 Projection Codes -- 4.1 Constructing Projection Codes -- 4.2 Instantiations -- 5 Holographic PCPs for RAM Programs -- 5.1 Holographic PCPs for Subsets -- 5.2 Holographic PCPs for RAM Programs -- 6 Succinct Arguments for RAM Programs -- References -- Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS -- 1 Introduction -- 1.1 Results and Contributions -- 2 Preliminaries.
Includes bibliographical references and index.
ISBN:9783031385452
3031385454
ISSN:1611-3349 ;
Source of Description, Etc. Note:Online resource; title from PDF title page (SpringerLink, viewed August 17, 2023).