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

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:
Data encryption (Computer science) > Congresses.
Computer security > Congresses.
Coding theory.
Computer engineering.
Computer networks.
Computer networks > Security measures.
Cryptography.
Data encryption (Computer science)
Information theory.
Electronic books.
proceedings (reports)
Conference papers and proceedings.
Actes de congrès.
Online Access:Click for online access
Table of Contents:
  • Intro
  • Preface
  • Organization
  • Contents - Part II
  • Succinctness
  • Revisiting Cycles of Pairing-Friendly Elliptic Curves
  • 1 Introduction
  • 1.1 Avoiding Non-native Arithmetic with Cycles
  • 1.2 State of the Art
  • 1.3 Contributions and Organization
  • 2 Pairing-Friendly Elliptic Curves
  • 2.1 Elliptic Curves
  • 2.2 Pairing-Friendly Polynomial Families
  • 3 Cycles of Elliptic Curves
  • 3.1 Definition and Known Results
  • 3.2 Some Properties of Cycles
  • 4 Cycles from Known Families
  • 4.1 Cycles from Parametric-Families
  • 4.2 2-cycles from Parametric Families
  • 5 Density of Pairing-Friendly Cycles
  • 6 Conclusions
  • A Polynomial Division
  • B Tables
  • C SageMath Code
  • References
  • Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
  • 1 Introduction
  • 1.1 Technical Overview
  • 2 Preliminaries
  • 2.1 Non-Interactive Zero-Knowledge Arguments for NP
  • 2.2 Non-Interactive Batch Arguments for NP
  • 2.3 Hidden-Bits Generator
  • 3 Hidden-Bits Generator from Batch Arguments
  • References
  • Lattice-Based Succinct Arguments from Vanishing Polynomials
  • 1 Introduction
  • 1.1 Our Results
  • 1.2 Related Work
  • 1.3 Subsequent Work
  • 2 Technical Overview
  • 2.1 Vanishing-SIS Commitments
  • 2.2 Efficient Proofs for SIS Relations
  • 2.3 Applications
  • 3 Preliminaries
  • 3.1 Cyclotomic Rings
  • 3.2 Lattice Trapdoors
  • 3.3 Presumed Hard Problems
  • 3.4 Argument Systems
  • 4 Vanishing Short Integer Solutions
  • 4.1 Definition
  • 4.2 On Choice of Parameters
  • 4.3 A Family of Hash Functions with Short Keys
  • 5 Foldable Structures
  • 6 Folding Protocols
  • 6.1 Type-0 Linear Relations
  • 6.2 Type-1 Linear Relations
  • 7 Knowledge-Based Protocols
  • 7.1 Linear Relations
  • 7.2 Well-Formedness of vSIS Commitments
  • 8 Applications
  • 8.1 Proving Binary-Satisfiability of (Structured) Linear Equations
  • 8.2 Rank-1 Constraint Systems
  • 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

Similar Items