top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Theory of cryptography . Part I : 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings / / Kobbi Nissim, Brent Waters (editors)
Theory of cryptography . Part I : 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings / / Kobbi Nissim, Brent Waters (editors)
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (799 pages)
Disciplina 005.82
Collana Lecture notes in computer science
Soggetto topico Data encryption (Computer science)
Computer networks - Security measures
ISBN 3-030-90459-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents - Part I -- Contents - Part II -- Contents - Part III -- Secure Quantum Computation with Classical Communication -- 1 Introduction -- 1.1 Results -- 1.2 Technical Overview -- 1.3 Discussion and Open Problems -- 1.4 Other Related Work -- 2 Preliminaries -- 2.1 Delegation of Quantum Computation -- 2.2 Quantum Fully-Homomorphic Encryption -- 2.3 Multi-party Quantum Computation -- 2.4 Classical Non-interactive Secure Computation -- 3 Generalizing the Alagic et al. Parallel Repetition Theorem -- 4 Composable Blind CVQC -- 4.1 CVQC for Quantum-Classical Circuits -- 4.2 Delegation of Quantum-Classical Circuits with Quantum Verifier -- 4.3 Making the Verifier Classical -- 4.4 Four-Message CVQC -- 5 Secure Quantum Computation -- 5.1 A Generic Construction of Multi-party Quantum Computation -- References -- Secure Software Leasing from Standard Assumptions -- 1 Introduction -- 1.1 Background -- 1.2 Our Results -- 1.3 Related Work -- 1.4 Concurrent Work -- 1.5 Technical Overview -- 1.6 Organization -- 2 Preliminaries -- 2.1 Noisy Trapdoor Claw-Free Hash Function -- 2.2 Secure Software Leasing -- 3 Two-Tier Quantum Lightning -- 3.1 Two-Tier Quantum Lightning -- 3.2 Two-Tier Quantum Lightning with Classical Verification -- 3.3 Two-Tier Quantum Lightning with Classical Verification from LWE -- 4 Relaxed Watermarking -- 4.1 Definition of Relaxed Watermarking -- 4.2 Relaxed Watermarking for PRF -- 5 Secure Software Leasing from Two-Tier Quantum Lightning -- References -- Post-quantum Resettably-Sound Zero Knowledge -- 1 Introduction -- 1.1 Contributions -- 2 Technical Overview -- 2.1 Defining Post-quantum Resettable Soundness -- 2.2 3-Message and Constant-Round-Public-Coin Protocols Can Be Made Resettably Sound -- 2.3 Constructing a Resettably Sound Non-Black-Box Zero-Knowledge Protocol.
2.4 From Resettable Soundness to Quantum Unobfuscatability -- 2.5 Related Work -- 3 Defining Post-Quantum Resettable Soundness -- 3.1 Post-Quantum Resettable Soundness -- 4 Transforming Protocols to Achieve Quantum Resettable Soundness -- 4.1 Quantum Oracle Notations -- 4.2 Transforming 3 Message Private Coin Protocols -- 4.3 Deterministic-Prefix Resetting Provers -- 5 A Post-Quantum Resettably Sound Zero Knowledge Protocol -- 5.1 Protocol Construction -- References -- Secure Software Leasing Without Assumptions -- 1 Introduction -- 1.1 Summary of Contributions -- 1.2 Open Problems -- 1.3 Outline -- 2 Preliminaries -- 2.1 Notation -- 2.2 Quantum Authentication -- 3 Definitions -- 3.1 Quantum Copy Protection -- 3.2 Secure Software Leasing -- 3.3 Distributions for Point Functions -- 4 Generic Results on Definitions -- 4.1 Reusability of the Program -- 4.2 Malicious-Malicious Security and Correctness -- 4.3 Secure Software Leasing and Honest-Malicious Copy Protection -- 4.4 Secure Software Leasing of Compute-and-Compare Circuits -- 5 Authentication-Based Copy Protection Scheme -- 5.1 Construction and Correctness -- 5.2 Honest-Malicious Security -- References -- The Round Complexity of Quantum Zero-Knowledge -- 1 Introduction -- 2 Technical Overview -- 2.1 Witness-Indistinguishable Arguments -- 2.2 Zero Knowledge Arguments -- 2.3 Zero Knowledge in the Timing Model -- 2.4 Related Work -- 3 Preliminaries -- 3.1 Quantum Adversaries -- 3.2 Learning with Errors -- 3.3 Pseudorandom Functions -- 3.4 Interactive Proofs and Sigma Protocols -- 3.5 Statistical ZAPs for NP -- 3.6 Sometimes-Binding Statistically Hiding Commitments -- 3.7 Quantum One-Time Pad -- 3.8 Homomorphic Encryption -- 4 Witness-Indistinguishable Arguments for QMA -- 4.1 Definition -- 4.2 Statistically Zero-Knowledge Sigma Protocol -- 4.3 2-Round Witness-Indistinguishable Arguments for QMA.
References -- Rate-1 Quantum Fully Homomorphic Encryption -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 2 Technical Overview -- 2.1 Malicious Circuit Privacy -- 2.2 Rate-1 Quantum Fully-Homomorphic Encryption -- 2.3 Putting Things Together -- 3 Preliminaries -- 3.1 Quantum Adversaries -- 3.2 Learning with Errors -- 3.3 Pauli Operators -- 3.4 Quantum One-Time Pad -- 4 Homomorphic Encryption -- 4.1 Classical Homomorphic Encryption -- 4.2 Quantum Homomorphic Encryption -- 5 Malicious Circuit Privacy for Quantum Computation -- 5.1 Semi-Honest Circuit Privacy -- 5.2 Our Bootstrapping Theorem -- 6 Rate-1 Quantum Fully Homomorphic Encryption -- 6.1 Definition -- 6.2 Our Construction -- References -- Unifying Presampling via Concentration Bounds -- 1 Introduction -- 1.1 Our Results -- 1.2 Open Problems -- 2 Preliminaries -- 2.1 Quantum Random Oracle Model -- 2.2 Compressed Oracle -- 2.3 Security Game with Classical Advice -- 2.4 Presampling Techniques for Random Oracles -- 2.5 Aaronson-Ambainis Conjecture -- 2.6 Concentration Bounds -- 3 Barriers for Leveraging Presampling Techniques -- 4 Unifying Presampling via Concentration Bounds -- 4.1 A New Characterization of Bit-Fixing -- 4.2 A Simpler Proof for Theorem 3 -- 5 Applications to AI-QROM -- 5.1 Presampling Techniques for Quantum Random Oracles -- 5.2 Post-quantum Non-uniform Security of Merkle-Damg̊ard Hash Functions (MDHF) -- 5.3 Post-quantum Non-uniform Security of One-Way Functions (OWF) -- References -- Quantum Key-Length Extension -- 1 Introduction -- 1.1 The FX Construction -- 1.2 Double Encryption -- 1.3 Overview -- 2 Preliminaries -- 2.1 Quantum Background -- 3 The FX Construction -- 3.1 Security of FX Against Non-adaptive Attacks -- 3.2 Adaptive Security of FFX -- 4 Double Encryption -- 4.1 Security Result -- 4.2 The Hardness of List Disjointness -- References.
Relationships Between Quantum IND-CPA Notions -- 1 Introduction -- 1.1 Previous Works -- 1.2 Our Contribution -- 1.3 Organization of the Paper -- 2 Preliminaries -- 3 Definitions -- 3.1 Syntax of l - The Learning Queries -- 3.2 Syntax of c - The Challenge Queries -- 3.3 Instantiation of Learning and Challenge Query Models -- 4 Decoherence Lemmas -- 5 Impossible Security Notions -- 6 Implications -- 7 Separations -- 7.1 Separations by Quasi-Length-Preserving Encryptions -- 7.2 Separations by Simon's Algorithm -- 7.3 Separations by Shi's SetEquality Problem -- 7.4 Separations by Other Arguments -- 8 Encryption Secure in All Notions -- References -- Classical Binding for Quantum Commitments -- 1 Introduction -- 1.1 Overview of Our Results and Techniques -- 1.2 Related Work -- 2 Preliminaries and Basic Tools -- 2.1 Quantum Formalism -- 2.2 Standard Tools -- 3 Classically Binding Quantum Commitments -- 3.1 Composition and Application -- 4 Construction -- 4.1 Split Classical Binding -- 4.2 Split Binding Amplification -- 4.3 SCBQC from Any One-Way Function -- 5 Classical Binding Is Impossible with Statistical Hiding -- References -- Unclonable Encryption, Revisited -- 1 Introduction -- 1.1 Our Work -- 1.2 Technical Overview -- 1.3 Structure of This Paper -- 2 Preliminaries -- 2.1 Notation -- 2.2 Quantum Computing -- 2.3 Post-Quantum Digital Signatures -- 2.4 Functional Encryption -- 2.5 Quantum Copy-Protection -- 2.6 Copy-Protection of Point Functions -- 3 Private-Key and Public-Key Unclonable Encryption: Definition -- 3.1 Unclonable Encryption -- 3.2 Private-Key and Public-Key Unclonable Encryption -- 4 Private-Key Unclonable Encryption (PK-UE) -- 4.1 Private-Key Encryption with Fake-Key Property -- 4.2 Construction -- 5 Public-Key Unclonable Encryption -- 5.1 Construction -- 6 Additional Results on Unclonable Encryption.
6.1 Generalized Conjugate Encryption -- 6.2 A Lower Bound for Conjugate Encryption -- 7 Construction of Copy-Protection from Unclonable Encryption -- References -- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs -- 1 Introduction -- 1.1 Multi-extractable Somewhere Statistically Binding (meSSB) Hash Families -- 1.2 Somewhere Statistically Sound (SSS) Interactive Arguments -- 1.3 SNARGs: From BatchNP to ¶ and Beyond -- 2 Preliminaries -- 2.1 Straight-Line Reductions -- 2.2 Probabilistically Checkable Proofs (PCP) -- 2.3 Hash Function Families with Local Opening -- 2.4 Kilian's Protocol -- 2.5 The BMW Heuristic -- 3 Somewhere Statistically Binding Hash Functions -- 3.1 Extractable Somewhere Statistically Binding (eSSB) Hash Functions -- 3.2 Multi-Extractable SSB (meSSB) Hash Functions -- 3.3 The BMW Protocol with meSSB Hash Families -- 4 Somewhere Statistically Sound Interactive Arguments -- 4.1 Defining SSS Arguments -- 4.2 SSS Implies Straight-Line Soundness -- 4.3 SSS Implies Post-Quantum Soundness -- 5 Kilian's Protocol Is Somewhere Statistically Sound -- 6 SNARG for Languages with Non-Signaling PCPs -- 6.1 BatchNP -- 6.2 SNARG for Languages with a Non-Signaling PCP -- A Proof of Theorem7 -- References -- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness -- 1 Introduction -- 1.1 Our Results -- 2 Our Techniques -- 2.1 BB Impossibility of 2-Round Delayed-Input Weak ZK -- 2.2 BB Impossibility of 2-Round Strong WI -- 3 Preliminaries -- 3.1 (, )-Approximation -- 3.2 2-Round Interactive Argument -- 3.3 Falsifiable Assumption and Black-Box Reduction -- 3.4 Puncturable (CCA-Secure) Public-Key Encryption -- 4 From 2-Round Delayed-Input Strong WI to 2-Round Special-Purpose Weak ZK -- 5 From Special-Purpose Weak ZK to Special-Purpose Pre-Processing ZK.
6 BB Impossibility of 2-Round Special-Purpose Pre-Processing ZK.
Record Nr. UNINA-9910508435903321
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Theory of cryptography . Part I : 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings / / Kobbi Nissim, Brent Waters (editors)
Theory of cryptography . Part I : 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings / / Kobbi Nissim, Brent Waters (editors)
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (799 pages)
Disciplina 005.82
Collana Lecture notes in computer science
Soggetto topico Data encryption (Computer science)
Computer networks - Security measures
ISBN 3-030-90459-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents - Part I -- Contents - Part II -- Contents - Part III -- Secure Quantum Computation with Classical Communication -- 1 Introduction -- 1.1 Results -- 1.2 Technical Overview -- 1.3 Discussion and Open Problems -- 1.4 Other Related Work -- 2 Preliminaries -- 2.1 Delegation of Quantum Computation -- 2.2 Quantum Fully-Homomorphic Encryption -- 2.3 Multi-party Quantum Computation -- 2.4 Classical Non-interactive Secure Computation -- 3 Generalizing the Alagic et al. Parallel Repetition Theorem -- 4 Composable Blind CVQC -- 4.1 CVQC for Quantum-Classical Circuits -- 4.2 Delegation of Quantum-Classical Circuits with Quantum Verifier -- 4.3 Making the Verifier Classical -- 4.4 Four-Message CVQC -- 5 Secure Quantum Computation -- 5.1 A Generic Construction of Multi-party Quantum Computation -- References -- Secure Software Leasing from Standard Assumptions -- 1 Introduction -- 1.1 Background -- 1.2 Our Results -- 1.3 Related Work -- 1.4 Concurrent Work -- 1.5 Technical Overview -- 1.6 Organization -- 2 Preliminaries -- 2.1 Noisy Trapdoor Claw-Free Hash Function -- 2.2 Secure Software Leasing -- 3 Two-Tier Quantum Lightning -- 3.1 Two-Tier Quantum Lightning -- 3.2 Two-Tier Quantum Lightning with Classical Verification -- 3.3 Two-Tier Quantum Lightning with Classical Verification from LWE -- 4 Relaxed Watermarking -- 4.1 Definition of Relaxed Watermarking -- 4.2 Relaxed Watermarking for PRF -- 5 Secure Software Leasing from Two-Tier Quantum Lightning -- References -- Post-quantum Resettably-Sound Zero Knowledge -- 1 Introduction -- 1.1 Contributions -- 2 Technical Overview -- 2.1 Defining Post-quantum Resettable Soundness -- 2.2 3-Message and Constant-Round-Public-Coin Protocols Can Be Made Resettably Sound -- 2.3 Constructing a Resettably Sound Non-Black-Box Zero-Knowledge Protocol.
2.4 From Resettable Soundness to Quantum Unobfuscatability -- 2.5 Related Work -- 3 Defining Post-Quantum Resettable Soundness -- 3.1 Post-Quantum Resettable Soundness -- 4 Transforming Protocols to Achieve Quantum Resettable Soundness -- 4.1 Quantum Oracle Notations -- 4.2 Transforming 3 Message Private Coin Protocols -- 4.3 Deterministic-Prefix Resetting Provers -- 5 A Post-Quantum Resettably Sound Zero Knowledge Protocol -- 5.1 Protocol Construction -- References -- Secure Software Leasing Without Assumptions -- 1 Introduction -- 1.1 Summary of Contributions -- 1.2 Open Problems -- 1.3 Outline -- 2 Preliminaries -- 2.1 Notation -- 2.2 Quantum Authentication -- 3 Definitions -- 3.1 Quantum Copy Protection -- 3.2 Secure Software Leasing -- 3.3 Distributions for Point Functions -- 4 Generic Results on Definitions -- 4.1 Reusability of the Program -- 4.2 Malicious-Malicious Security and Correctness -- 4.3 Secure Software Leasing and Honest-Malicious Copy Protection -- 4.4 Secure Software Leasing of Compute-and-Compare Circuits -- 5 Authentication-Based Copy Protection Scheme -- 5.1 Construction and Correctness -- 5.2 Honest-Malicious Security -- References -- The Round Complexity of Quantum Zero-Knowledge -- 1 Introduction -- 2 Technical Overview -- 2.1 Witness-Indistinguishable Arguments -- 2.2 Zero Knowledge Arguments -- 2.3 Zero Knowledge in the Timing Model -- 2.4 Related Work -- 3 Preliminaries -- 3.1 Quantum Adversaries -- 3.2 Learning with Errors -- 3.3 Pseudorandom Functions -- 3.4 Interactive Proofs and Sigma Protocols -- 3.5 Statistical ZAPs for NP -- 3.6 Sometimes-Binding Statistically Hiding Commitments -- 3.7 Quantum One-Time Pad -- 3.8 Homomorphic Encryption -- 4 Witness-Indistinguishable Arguments for QMA -- 4.1 Definition -- 4.2 Statistically Zero-Knowledge Sigma Protocol -- 4.3 2-Round Witness-Indistinguishable Arguments for QMA.
References -- Rate-1 Quantum Fully Homomorphic Encryption -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 2 Technical Overview -- 2.1 Malicious Circuit Privacy -- 2.2 Rate-1 Quantum Fully-Homomorphic Encryption -- 2.3 Putting Things Together -- 3 Preliminaries -- 3.1 Quantum Adversaries -- 3.2 Learning with Errors -- 3.3 Pauli Operators -- 3.4 Quantum One-Time Pad -- 4 Homomorphic Encryption -- 4.1 Classical Homomorphic Encryption -- 4.2 Quantum Homomorphic Encryption -- 5 Malicious Circuit Privacy for Quantum Computation -- 5.1 Semi-Honest Circuit Privacy -- 5.2 Our Bootstrapping Theorem -- 6 Rate-1 Quantum Fully Homomorphic Encryption -- 6.1 Definition -- 6.2 Our Construction -- References -- Unifying Presampling via Concentration Bounds -- 1 Introduction -- 1.1 Our Results -- 1.2 Open Problems -- 2 Preliminaries -- 2.1 Quantum Random Oracle Model -- 2.2 Compressed Oracle -- 2.3 Security Game with Classical Advice -- 2.4 Presampling Techniques for Random Oracles -- 2.5 Aaronson-Ambainis Conjecture -- 2.6 Concentration Bounds -- 3 Barriers for Leveraging Presampling Techniques -- 4 Unifying Presampling via Concentration Bounds -- 4.1 A New Characterization of Bit-Fixing -- 4.2 A Simpler Proof for Theorem 3 -- 5 Applications to AI-QROM -- 5.1 Presampling Techniques for Quantum Random Oracles -- 5.2 Post-quantum Non-uniform Security of Merkle-Damg̊ard Hash Functions (MDHF) -- 5.3 Post-quantum Non-uniform Security of One-Way Functions (OWF) -- References -- Quantum Key-Length Extension -- 1 Introduction -- 1.1 The FX Construction -- 1.2 Double Encryption -- 1.3 Overview -- 2 Preliminaries -- 2.1 Quantum Background -- 3 The FX Construction -- 3.1 Security of FX Against Non-adaptive Attacks -- 3.2 Adaptive Security of FFX -- 4 Double Encryption -- 4.1 Security Result -- 4.2 The Hardness of List Disjointness -- References.
Relationships Between Quantum IND-CPA Notions -- 1 Introduction -- 1.1 Previous Works -- 1.2 Our Contribution -- 1.3 Organization of the Paper -- 2 Preliminaries -- 3 Definitions -- 3.1 Syntax of l - The Learning Queries -- 3.2 Syntax of c - The Challenge Queries -- 3.3 Instantiation of Learning and Challenge Query Models -- 4 Decoherence Lemmas -- 5 Impossible Security Notions -- 6 Implications -- 7 Separations -- 7.1 Separations by Quasi-Length-Preserving Encryptions -- 7.2 Separations by Simon's Algorithm -- 7.3 Separations by Shi's SetEquality Problem -- 7.4 Separations by Other Arguments -- 8 Encryption Secure in All Notions -- References -- Classical Binding for Quantum Commitments -- 1 Introduction -- 1.1 Overview of Our Results and Techniques -- 1.2 Related Work -- 2 Preliminaries and Basic Tools -- 2.1 Quantum Formalism -- 2.2 Standard Tools -- 3 Classically Binding Quantum Commitments -- 3.1 Composition and Application -- 4 Construction -- 4.1 Split Classical Binding -- 4.2 Split Binding Amplification -- 4.3 SCBQC from Any One-Way Function -- 5 Classical Binding Is Impossible with Statistical Hiding -- References -- Unclonable Encryption, Revisited -- 1 Introduction -- 1.1 Our Work -- 1.2 Technical Overview -- 1.3 Structure of This Paper -- 2 Preliminaries -- 2.1 Notation -- 2.2 Quantum Computing -- 2.3 Post-Quantum Digital Signatures -- 2.4 Functional Encryption -- 2.5 Quantum Copy-Protection -- 2.6 Copy-Protection of Point Functions -- 3 Private-Key and Public-Key Unclonable Encryption: Definition -- 3.1 Unclonable Encryption -- 3.2 Private-Key and Public-Key Unclonable Encryption -- 4 Private-Key Unclonable Encryption (PK-UE) -- 4.1 Private-Key Encryption with Fake-Key Property -- 4.2 Construction -- 5 Public-Key Unclonable Encryption -- 5.1 Construction -- 6 Additional Results on Unclonable Encryption.
6.1 Generalized Conjugate Encryption -- 6.2 A Lower Bound for Conjugate Encryption -- 7 Construction of Copy-Protection from Unclonable Encryption -- References -- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs -- 1 Introduction -- 1.1 Multi-extractable Somewhere Statistically Binding (meSSB) Hash Families -- 1.2 Somewhere Statistically Sound (SSS) Interactive Arguments -- 1.3 SNARGs: From BatchNP to ¶ and Beyond -- 2 Preliminaries -- 2.1 Straight-Line Reductions -- 2.2 Probabilistically Checkable Proofs (PCP) -- 2.3 Hash Function Families with Local Opening -- 2.4 Kilian's Protocol -- 2.5 The BMW Heuristic -- 3 Somewhere Statistically Binding Hash Functions -- 3.1 Extractable Somewhere Statistically Binding (eSSB) Hash Functions -- 3.2 Multi-Extractable SSB (meSSB) Hash Functions -- 3.3 The BMW Protocol with meSSB Hash Families -- 4 Somewhere Statistically Sound Interactive Arguments -- 4.1 Defining SSS Arguments -- 4.2 SSS Implies Straight-Line Soundness -- 4.3 SSS Implies Post-Quantum Soundness -- 5 Kilian's Protocol Is Somewhere Statistically Sound -- 6 SNARG for Languages with Non-Signaling PCPs -- 6.1 BatchNP -- 6.2 SNARG for Languages with a Non-Signaling PCP -- A Proof of Theorem7 -- References -- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness -- 1 Introduction -- 1.1 Our Results -- 2 Our Techniques -- 2.1 BB Impossibility of 2-Round Delayed-Input Weak ZK -- 2.2 BB Impossibility of 2-Round Strong WI -- 3 Preliminaries -- 3.1 (, )-Approximation -- 3.2 2-Round Interactive Argument -- 3.3 Falsifiable Assumption and Black-Box Reduction -- 3.4 Puncturable (CCA-Secure) Public-Key Encryption -- 4 From 2-Round Delayed-Input Strong WI to 2-Round Special-Purpose Weak ZK -- 5 From Special-Purpose Weak ZK to Special-Purpose Pre-Processing ZK.
6 BB Impossibility of 2-Round Special-Purpose Pre-Processing ZK.
Record Nr. UNISA-996464507603316
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, proceedings, part II / / edited by Kobbi Nissim and Brent Waters
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, proceedings, part II / / edited by Kobbi Nissim and Brent Waters
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (764 pages)
Disciplina 005.824
Collana Lecture Notes in Computer Science
Soggetto topico Data encryption (Computer science)
Computer networks - Security measures
ISBN 3-030-90453-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents - Part II -- Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments -- 1 Introduction -- 1.1 Limitations of Prior Approaches -- 1.2 Review of LCC-DLOG Techniques -- 1.3 Core Techniques Enabling a Logarithmic Verifier in Dory -- 2 Preliminaries -- 2.1 Notation -- 2.2 Computationally Hard Problems in Type III Pairings -- 2.3 Succinct Interactive Arguments of Knowledge -- 2.4 Commitments -- 2.5 Polynomial Commitments and Evaluation from Vector-Matrix-Vector Products -- 3 An Inner-Product Argument with a Logarithmic Verifier -- 3.1 Scalar-Product -- 3.2 Dory-Reduce -- 3.3 Dory-Innerproduct -- 3.4 Batching Inner Products -- 4 Inner Products with Public Vectors of Scalars -- 4.1 General Reduction with O (n) cost -- 4.2 Extending Dory-Reduce -- 4.3 Extending Dory-Innerproduct -- 4.4 Extending Batch-Innerproduct -- 5 Vector-Matrix-Vector Products -- 5.1 Batching -- 5.2 Concrete Costs -- 6 Dory-PC -- 6.1 Concrete Costs of Dory-PC-RE -- 6.2 Batching -- 7 Implementation -- References -- On Communication-Efficient Asynchronous MPC with Adaptive Security -- 1 Introduction -- 1.1 Communication Complexity of Asynchronous MPC Protocols -- 1.2 Contributions -- 2 Preliminaries -- 2.1 Communication and Adversary Model -- 2.2 Zero-Knowledge Proofs of Knowledge -- 2.3 Universally Composable Commitments -- 2.4 Threshold Homomorphic Encryption -- 3 Subprotocols -- 3.1 Agreement Protocols -- 3.2 Decryption Protocols -- 3.3 Multiplication -- 3.4 Triple Generation -- 4 Asynchronous Adaptively Secure MPC Protocol -- 4.1 Ideal Functionality -- 4.2 Informal Explanation of the Protocol -- 4.3 Main Theorem -- 5 Near-Linear MPC in the Atomic Send Model -- 5.1 Model -- 5.2 VACS -- 5.3 Triple Generation -- 5.4 Main Theorem for the Atomic Send Model -- A Details of the Subprotocols.
A.1 Decryption protocols -- A.2 Multiplication -- B Protocol -- References -- Efficient Perfectly Secure Computation with Optimal Resilience -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 1.3 Open Problems -- 2 Technical Overview -- 2.1 Overview of the BGW Protocol -- 2.2 Our Protocol -- 2.3 Extensions -- 2.4 Organization -- 3 Preliminaries -- 3.1 Definitions of Perfect Security in the Presence of Malicious Adversaries -- 3.2 Robust Secret Sharing -- 3.3 Bivariate Polynomial -- 4 Weak Verifiable Secret Sharing and Extensions -- 4.1 Verifying Shares of a (q,t)-Bivariate Polynomial -- 4.2 Weak Verifiable Secret Sharing -- 4.3 Evaluation with the Help of the Dealer -- 4.4 Strong Verifiable Secret Sharing -- 4.5 Extending Univariate Sharing to Bivariate Sharing with a Dealer -- 5 Multiplication with a Constant Number of VSSs and WSSs -- 5.1 Functionality - Multiplication with a Dealer -- 5.2 The Protocol -- 6 Extension: Arbitrary Gates with Multiplicative Depth-1 -- References -- On Communication Models and Best-Achievable Security in Two-Round MPC -- 1 Introduction -- 1.1 Our Results in Detail -- 1.2 Related Work -- 2 Technical Overview -- 2.1 Lower Bounds in the BC only Model -- 2.2 BC+P2P Model -- 2.3 BC+PKI Model -- 3 Preliminaries -- 3.1 Oblivious Transfer (OT) -- 3.2 Multi-CRS Non-interactive Zero Knowledge (m-NIZK) -- 4 Broadcast Model -- 4.1 Lower Bound for t=1 -- 4.2 Impossibility of Two-Message mR-OT in the Plain Model -- 5 BC+P2P Model -- 5.1 Impossibility Result for Identifiable Result -- 5.2 Fail-Stop Guaranteed Output Delivery -- 6 BC+PKI Model: Guaranteed Output Delivery -- References -- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Threshold Secret Sharing.
2.2 Computation Model: Layered Straight-Line Programs -- 3 Generalized Pseudorandom Secret Sharing -- 3.1 Overview -- 3.2 The Gilboa-Ishai Framework -- 3.3 Technical Tool: Covering Designs -- 3.4 Generalized PRSS for Degree-d Polynomials -- 3.5 Double Shamir Sharing -- 3.6 Beyond Double Sharing -- 4 Constructions for Semi-honest Security -- 4.1 Baseline Protocol (with =1) -- 4.2 Straggler Resilience -- 4.3 Reducing Communication and Computation -- 5 From Semi-honest to Malicious Security -- 5.1 Privacy in the Presence of Malicious Adversaries -- 5.2 Verifying Correctness of the Computation -- 5.3 Putting It All Together - The Main Protocol -- References -- Blockchains Enable Non-interactive MPC -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Preliminaries - CSaRs -- 3 Our Non-interactive MPC Construction -- 3.1 Construction Overview -- 4 Optimizations -- 5 Optimizing Communication and State Complexity in MPC -- 5.1 Step. 1: MPC with Semi-malicious Security -- 5.2 Step. 2: MPC with Fully Malicious Security -- 5.3 Properties of the Resulting MPC Construction -- 6 Guaranteed Output Delivery -- References -- Multi-party PSM, Revisited: -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Proof Overview -- 1.3 Related Works -- 2 Preliminaries -- 2.1 Tensor -- 2.2 Private Simultaneous Messages -- 2.3 Randomized Encoding -- 3 New Multi-party PSM Protocols -- 3.1 A Framework for Multi-party PSM -- 3.2 The Induced PSM Protocol -- 3.3 When k is Small -- 3.4 When k+1 is a Prime Power -- 4 Unbalanced 2-Party PSM Protocols -- 4.1 A Framework for 2-Party PSM -- 4.2 The Induced PSM Protocol -- 4.3 When Has a Small Denominator -- 5 Open Problems -- A Proof of Eq. (9) and (10) -- B Auxiliary PSM Protocols for "426830A x1 …xk, Y "526930B + s -- B.1 The Multi-party Variant -- B.2 The 2-party Variant -- References.
Multi-Party Functional Encryption -- 1 Introduction -- 1.1 Unifying the View: Multi-Party Functional Encryption -- 1.2 Comparison with Prior Work -- 1.3 New Constructions -- 1.4 Technical Overview -- 1.5 Predicting New and Useful Primitives via MPFE -- 2 Multi-Party Functional Encryption -- 3 Multi-Authority ABE IPFE for LSSS Access Structures -- 3.1 Specializing the MPFE Syntax -- 3.2 Construction -- 3.3 Correctness and Security -- 4 Function-Hiding DDFE for Inner Products -- 4.1 Specializing the MPFE Syntax -- 4.2 Construction of Function-Hiding IP-MCFE -- 4.3 Construction of Function-Hiding IP-DDFE -- References -- Succinct LWE Sampling, Random Polynomials, and Obfuscation -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Discussion -- 2 Preliminaries -- 2.1 Notations -- 2.2 Learning with Errors -- 2.3 Lattice Tools -- 2.4 Homomorphic Operations -- 2.5 Succinct Randomized Encodings -- 3 Succinct LWE Sampler: Definition and Amplification -- 3.1 Definition and Discussion -- 3.2 Weak Succinct LWE Samplers -- 3.3 Amplification -- 4 Candidate Succinct LWE Sampler -- 4.1 A Basic Framework -- 4.2 Correctness, Succinctness, and LWE with Respect to A* -- 4.3 Instantiating the Parameters -- 4.4 Alternate Candidate Construction -- 4.5 Cryptanalysis -- 4.6 Cryptanalytic Challenges -- 5 Our Succinct Randomized Encoding Construction -- 5.1 Security -- References -- ABE for DFA from LWE Against Bounded Collusions, Revisited*-8pt -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview I: T1/2 -- 1.3 Technical Overview II: ABE for DFA -- 1.4 Prior Works -- 1.5 Discussion -- 2 Preliminaries -- 2.1 Attribute-Based Encryption -- 2.2 Lattices Background -- 3 Trapdoor Sampling with T1/2 and a Computational Lemma -- 3.1 LWE Implies T1/2-LWE -- 3.2 Trapdoor Sampling with T1/2 -- 4 ABE for DFA Against Bounded Collusions.
4.1 Our Scheme -- 4.2 sk-Selective Security -- 5 Candidate ABE for DFA Against Unbounded Collusions -- References -- Distributed Merkle's Puzzles -- 1 Introduction -- 1.1 Distributed Key Agreement Based on Symmetric-Key Primitives -- 1.2 Our Results -- 1.3 Overview of the Protocol and Its Analysis -- 1.4 Previous Work -- 2 Preliminaries -- 2.1 Graphs -- 2.2 Random Functions and Encryption -- 3 Distributed Key Agreement Protocols Based on Random Oracles -- 4 The Setup Protocol -- 4.1 Correctness -- 4.2 Query and Communication Complexity -- 4.3 Connectivity -- 4.4 Security -- 5 The Distributed Key Agreement Protocol -- 5.1 Security Analysis -- 5.2 Main Theorem -- 6 Optimality of the Distributed Key Agreement Protocol -- 7 Extensions -- 7.1 The Semi-honest Model -- 7.2 Communication-Security Tradeoff -- References -- Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity -- 1 Introduction -- 1.1 Non-malleability Against Joint Tampering -- 1.2 Our Results -- 1.3 Overview of Techniques -- 1.4 Related Work -- 2 Standard Definitions -- 2.1 Non-interactive Commitment Schemes -- 2.2 Symmetric Encryption -- 2.3 Information Dispersal -- 3 Secret Sharing Schemes -- 3.1 Tampering and Leakage Model -- 3.2 Related Notions -- 4 Rate-Zero Continuously Non-malleable Secret Sharing -- 4.1 Induction Basis -- 4.2 Inductive Step -- 4.3 Putting It Together -- 5 Rate Compilers and Capacity Upper Bounds -- 5.1 Capacity Upper Bounds -- 5.2 Rate Compiler (Plain Model) -- 6 Instantiations -- 6.1 Leakage-Resilient p-time Non-malleable Code -- 6.2 Leakage-Resilient Continuously Non-malleable Secret Sharing -- 6.3 Breaking the Rate-One Barrier -- References -- Disappearing Cryptography in the Bounded Storage Model -- 1 Introduction -- 1.1 Motivating Examples -- 1.2 Our Results -- 1.3 Defining Obfuscation in the Bounded Storage Model.
1.4 Applications.
Record Nr. UNISA-996464400103316
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings : part III / / edited by Kobbi Nissim and Brent Waters
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings : part III / / edited by Kobbi Nissim and Brent Waters
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (525 pages)
Disciplina 005.824
Collana Lecture Notes in Computer Science
Soggetto topico Computer security
Data encryption (Computer science)
Computer networks
ISBN 3-030-90456-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents - Part III -- Covert Learning: How to Learn with an Untrusted Intermediary -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Real World Applications -- 1.3 Related Work -- 2 Covert Learning -- 2.1 Preliminaries -- 2.2 Definition of Covert Learning -- 2.3 A Warm-Up: Covert Learning of Noisy Parity Functions -- 2.4 Covert Learning of Low-Degree Fourier Coefficients -- 2.5 Covert Learning of Polynomial Size Decision Trees -- 3 Covert Verifiable Learning -- 3.1 Definition of Covert Verifiable Learning -- 3.2 Making CLF Verifiable -- 3.3 Making CLDT Verifiable -- 3.4 Verifiability Without Secret Examples -- References -- Random-Index PIR and Applications -- 1 Introduction -- 1.1 Random-Index PIR (RPIR) -- 1.2 Applications -- 1.3 Batch RPIR -- 1.4 Multi-server RPIR -- 1.5 Organization -- 2 Random-Index Private Information Retrieval -- 2.1 Background: Private Information Retrieval -- 2.2 Defining RPIR -- 2.3 Defining Multi-server RPIR -- 2.4 RPIR is equivalent to PIR -- 3 RPIR Protocols -- 3.1 Noninteractive RPIR -- 3.2 Multi-server RPIR Protocols -- 4 Applications to Large-Scale DoS-Resistant Computation -- 4.1 Target Anonymous Communication Channels from RPIR -- 5 Batch RPIR -- 5.1 Definitions -- 5.2 Constructions -- A Random-Index Oblivious-RAM -- A.1 Target Anonymous Channels from RORAM -- B Target Anonymous Channels from Mix-Nets -- References -- Forward Secret Encrypted RAM: Lower Bounds and Applications -- 1 Introduction -- 1.1 Our Main Result: Lower Bound -- 1.2 ``Bypassing'' the Lower Bound -- 2 Lower Bound Model -- 2.1 Framework for Symbolic Private Data Structure Lower Bounds -- 2.2 Symbolic Definitions for Allowed Primitives -- 2.3 FS eRAM Symbolic Definition -- 3 Forward Secret Encrypted RAM Lower Bound -- 3.1 Minimality and Usefulness -- 3.2 Key-Data Graph -- 3.3 Adversarial Strategy.
4 Stronger Forward Secret Encrypted RAM Definitions -- 5 Oblivious Forward Secret Encrypted RAM -- 5.1 Definitions -- 5.2 Oblivious Forward Secret Encrypted RAM Construction -- 6 Forward Secret Memory Checkers -- 6.1 Forward Secret Memory Checker Definition -- 6.2 Forward Secret Memory Checker Construction -- References -- Laconic Private Set Intersection and Applications -- 1 Introduction -- 1.1 Our Results -- 1.2 Previous Work -- 1.3 Open Problems -- 2 Technical Overview -- 2.1 Semi-Honest PSI from CDH/LWE -- 2.2 Reusable Laconic PSI -- 2.3 DV-NIZK Range Proofs for DJ Ciphertexts -- 2.4 Labeled Laconic PSI and Laconic OT -- 3 Preliminaries -- 3.1 Hardness Assumptions -- 3.2 Laconic Private Set Intersection -- 4 Semi-Honest Laconic PSI from CDH/LWE -- 5 Reusable DV-NIZK Range Proofs for DJ Ciphertexts -- 5.1 Equality of Plaintexts in DJ and BGN Ciphertexts -- 5.2 DV-NIZK for Range Proofs of DJ Ciphertexts with Equal Discrete Log -- 6 Reusable Laconic Private Set Intersection -- 7 Self-Detecting Encryption -- References -- Amortizing Rate-1 OT and Applications to PIR and PSI -- 1 Introduction -- 1.1 Our Results -- 1.2 Applications -- 1.3 Comparison with Prior Work -- 2 Technical Overview -- 3 Preliminaries and Definitions -- 3.1 Amortized Rate-1 OT: Definition -- 4 Amortized Rate-1 OT from SXDH -- 4.1 Our Construction -- 4.2 Receiver Privacy -- 5 Amortized Rate-1 OT from Bilinear Power DDH -- 5.1 Receiver Privacy -- 6 Optimization -- 6.1 Delayed Pairing -- 6.2 Increasing Vector Dimension -- 7 Applications -- 7.1 Secure Function Evaluation on Branching Programs -- 7.2 PSI and PIR -- 7.3 Optimization for PSI and PSI-Cardinality -- 7.4 Other Variants of PSI and PIR -- 8 Amortized Rate-1 OT with Strong Sender Privacy -- References -- Ring-Based Identity Based Encryption - Asymptotically Shorter MPK and Tighter Security -- 1 Introduction.
1.1 Our Contributions -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Identity-Based Encryption (IBE) -- 2.2 Concrete Bit-Security -- 2.3 Lattices and Gaussian Distributions -- 2.4 Rings and Ideal Lattices -- 3 New Homomorphic Equality Test and Tighter Analysis -- 3.1 Homomorphic Equality Testing -- 3.2 Our Construction -- 3.3 An Optimization with Tighter Analysis -- 3.4 Application to Packing/Unpacking Homomorphic Encodings -- 4 New Partition Function and Homomorphic Evaluation -- 4.1 Our New Hash Function Family -- 4.2 Homomorphic Evaluation of the Partitioning Function -- 5 IBE Design and Analysis -- 5.1 Construction -- 5.2 Security -- 5.3 Asymptotic and Concrete Parameters -- References -- Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption -- 1 Introduction -- 2 Repliable Onion Encryption: Syntax and Correctness -- 2.1 Onion Evolutions, Forward Paths, Return Paths and Layerings -- 3 FROES: Onion Routing in the SUC Framework -- 3.1 Ideal Functionality FROES -- 3.2 SUC-realizability of FROES -- 4 Repliable-Onion Security: A Game-Based Definition -- 5 Repliable-Onion Security SUC-Realizability of FROES -- 6 Shallot Encryption -- 7 Shallot Encryption Scheme Is Secure -- A Security Game for Variants (b) and (c) -- References -- Grafting Key Trees: Efficient Key Management for Overlapping Groups -- 1 Introduction -- 1.1 The Asymptotic Setting -- 1.2 The Non-asymptotic Setting -- 1.3 Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Huffman Codes -- 3 Key-Derivation Graphs for Multiple Groups -- 3.1 Continuous Group-Key Agreement and Multicast Encryption -- 3.2 Key-Derivation Graphs -- 3.3 Security -- 3.4 The Trivial Algorithm -- 4 Key-Derivation Graphs in the Asymptotic Setting -- 4.1 Key-Derivation Graphs in the Asymptotic Setting -- 4.2 Update Cost for Concrete Group Systems.
5 A Greedy Algorithm Based on Huffman Codes -- 5.1 Algorithm Description -- 5.2 Total Update Cost -- 5.3 Asymptotic Optimality of Boolean-Lattice Based Graphs -- 6 Lower Bound on the Update Cost of CGKA -- 6.1 Symbolic Model -- 6.2 Lower Bound on the Average Update Cost -- 7 Open Problems -- 7.1 Optimal Key-Derivation Graphs -- 7.2 Security -- 7.3 Efficiency of Dynamic Operations -- References -- Updatable Public Key Encryption in the Standard Model -- 1 Introduction -- 1.1 Our Technique: Using Circular Security and Leakage-Resilience -- 1.2 Additional Theoretical Contributions -- 1.3 Related Work -- 2 Preliminaries -- 3 Updatable Public Key Encryption (UPKE) -- 3.1 IND-CR-CPA Security of UPKE -- 4 Key-Dependent-Message-Secure Encryption Scheme -- 5 DDH Based Construction -- 5.1 The BHHO Cryptosystem -- 5.2 CS+LR Security of BHHO Cryptosystem -- 5.3 UPKE Construction -- 5.4 Security of the UPKE Construction -- 6 Constructions Based on LWE -- 6.1 The Dual Regev or GPV Cryptosystem -- 6.2 CS+LR Security of the Dual-Regev Cryptosystem -- 6.3 UPKE Construction -- 6.4 Security of the UPKE Construction -- 7 Towards Stronger Security -- References -- Towards Tight Adaptive Security of Non-interactive Key Exchange -- 1 Introduction -- 1.1 Technical Overview -- 2 Preliminaries -- 2.1 Pairing Group Assumptions -- 2.2 Non-Interactive Key Exchange -- 3 An Inner-Product-Based NIKE Scheme -- 4 Lower Bound -- 4.1 Lower Bound for Inner-product NIKEs -- References -- On the Impossibility of Purely Algebraic Signatures -- 1 Introduction -- 1.1 Related Work -- 1.2 Technical Outline -- 2 Preliminaries -- 2.1 Notation -- 2.2 Generic Group Model -- 2.3 Signatures -- 3 Signature Schemes over Groups of Prime Order -- 3.1 Algebraic Signatures -- 3.2 Preparation -- 3.3 Impossibility of Secure Algebraic Signatures -- 4 Signature Schemes over Groups of Unknown Order.
4.1 Simplified Algebraic Signatures -- 4.2 Hermite Normal Form -- 4.3 An Inefficient AddColumn Procedure for Matrices in HNF -- 4.4 Impossibility of Simplified Algebraic Signatures -- 5 Extension: BLS Signatures Instantiated with Algebraic Hash Functions Are Insecure -- References -- Policy-Compliant Signatures -- 1 Introduction -- 1.1 Applications of PCS -- 1.2 Our Contributions and Organization of this Paper -- 1.3 Related Work -- 2 Preliminaries -- 3 Policy-Compliant Signatures -- 3.1 Adversarial Capabilities in the Security Games -- 3.2 Existential Unforgeability -- 3.3 Indistinguishability-Based Attribute Hiding -- 4 Construction of a Policy-Compliant Signature Scheme -- 4.1 The Scheme -- 4.2 Correctness -- 4.3 Existential Unforgeability -- 4.4 Indistinguishability-Based Attribute Hiding -- 4.5 Efficient Instantiations Based on Inner-Product PE -- 5 Universal Composability and SIM-Based PCS -- 5.1 Simulation-Based Attribute Hiding -- 5.2 On the SIM-Based Security of our Generic Scheme -- References -- Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Additional Related Work and Open Problems -- 1.3 Technical Overview -- 1.4 Paper Organization -- 2 Preliminaries -- 3 Succinct Proofs of Correct Exponentiation -- 3.1 The Basic Definition -- 3.2 Batch Proofs of Correct Exponentiation -- 4 Warm-Up: The Random Subset Compiler -- 5 Amplifying Soundness and Reducing Communication -- 6 An Improved Compiler from the Low Order Assumption -- 6.1 The Compiler -- 6.2 Soundness Analysis Based on the Low Order Assumption -- References -- Non-malleable Vector Commitments via Local Equivocability -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Applications -- 1.3 Overview of Our Approach -- 1.4 Open Problems -- 1.5 Paper Organization -- 2 Preliminaries.
2.1 Equivocable Commitment Schemes.
Record Nr. UNINA-9910508444103321
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, proceedings, part II / / edited by Kobbi Nissim and Brent Waters
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, proceedings, part II / / edited by Kobbi Nissim and Brent Waters
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (764 pages)
Disciplina 005.824
Collana Lecture Notes in Computer Science
Soggetto topico Data encryption (Computer science)
Computer networks - Security measures
ISBN 3-030-90453-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents - Part II -- Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments -- 1 Introduction -- 1.1 Limitations of Prior Approaches -- 1.2 Review of LCC-DLOG Techniques -- 1.3 Core Techniques Enabling a Logarithmic Verifier in Dory -- 2 Preliminaries -- 2.1 Notation -- 2.2 Computationally Hard Problems in Type III Pairings -- 2.3 Succinct Interactive Arguments of Knowledge -- 2.4 Commitments -- 2.5 Polynomial Commitments and Evaluation from Vector-Matrix-Vector Products -- 3 An Inner-Product Argument with a Logarithmic Verifier -- 3.1 Scalar-Product -- 3.2 Dory-Reduce -- 3.3 Dory-Innerproduct -- 3.4 Batching Inner Products -- 4 Inner Products with Public Vectors of Scalars -- 4.1 General Reduction with O (n) cost -- 4.2 Extending Dory-Reduce -- 4.3 Extending Dory-Innerproduct -- 4.4 Extending Batch-Innerproduct -- 5 Vector-Matrix-Vector Products -- 5.1 Batching -- 5.2 Concrete Costs -- 6 Dory-PC -- 6.1 Concrete Costs of Dory-PC-RE -- 6.2 Batching -- 7 Implementation -- References -- On Communication-Efficient Asynchronous MPC with Adaptive Security -- 1 Introduction -- 1.1 Communication Complexity of Asynchronous MPC Protocols -- 1.2 Contributions -- 2 Preliminaries -- 2.1 Communication and Adversary Model -- 2.2 Zero-Knowledge Proofs of Knowledge -- 2.3 Universally Composable Commitments -- 2.4 Threshold Homomorphic Encryption -- 3 Subprotocols -- 3.1 Agreement Protocols -- 3.2 Decryption Protocols -- 3.3 Multiplication -- 3.4 Triple Generation -- 4 Asynchronous Adaptively Secure MPC Protocol -- 4.1 Ideal Functionality -- 4.2 Informal Explanation of the Protocol -- 4.3 Main Theorem -- 5 Near-Linear MPC in the Atomic Send Model -- 5.1 Model -- 5.2 VACS -- 5.3 Triple Generation -- 5.4 Main Theorem for the Atomic Send Model -- A Details of the Subprotocols.
A.1 Decryption protocols -- A.2 Multiplication -- B Protocol -- References -- Efficient Perfectly Secure Computation with Optimal Resilience -- 1 Introduction -- 1.1 Our Results -- 1.2 Related Work -- 1.3 Open Problems -- 2 Technical Overview -- 2.1 Overview of the BGW Protocol -- 2.2 Our Protocol -- 2.3 Extensions -- 2.4 Organization -- 3 Preliminaries -- 3.1 Definitions of Perfect Security in the Presence of Malicious Adversaries -- 3.2 Robust Secret Sharing -- 3.3 Bivariate Polynomial -- 4 Weak Verifiable Secret Sharing and Extensions -- 4.1 Verifying Shares of a (q,t)-Bivariate Polynomial -- 4.2 Weak Verifiable Secret Sharing -- 4.3 Evaluation with the Help of the Dealer -- 4.4 Strong Verifiable Secret Sharing -- 4.5 Extending Univariate Sharing to Bivariate Sharing with a Dealer -- 5 Multiplication with a Constant Number of VSSs and WSSs -- 5.1 Functionality - Multiplication with a Dealer -- 5.2 The Protocol -- 6 Extension: Arbitrary Gates with Multiplicative Depth-1 -- References -- On Communication Models and Best-Achievable Security in Two-Round MPC -- 1 Introduction -- 1.1 Our Results in Detail -- 1.2 Related Work -- 2 Technical Overview -- 2.1 Lower Bounds in the BC only Model -- 2.2 BC+P2P Model -- 2.3 BC+PKI Model -- 3 Preliminaries -- 3.1 Oblivious Transfer (OT) -- 3.2 Multi-CRS Non-interactive Zero Knowledge (m-NIZK) -- 4 Broadcast Model -- 4.1 Lower Bound for t=1 -- 4.2 Impossibility of Two-Message mR-OT in the Plain Model -- 5 BC+P2P Model -- 5.1 Impossibility Result for Identifiable Result -- 5.2 Fail-Stop Guaranteed Output Delivery -- 6 BC+PKI Model: Guaranteed Output Delivery -- References -- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Related Work -- 2 Preliminaries -- 2.1 Threshold Secret Sharing.
2.2 Computation Model: Layered Straight-Line Programs -- 3 Generalized Pseudorandom Secret Sharing -- 3.1 Overview -- 3.2 The Gilboa-Ishai Framework -- 3.3 Technical Tool: Covering Designs -- 3.4 Generalized PRSS for Degree-d Polynomials -- 3.5 Double Shamir Sharing -- 3.6 Beyond Double Sharing -- 4 Constructions for Semi-honest Security -- 4.1 Baseline Protocol (with =1) -- 4.2 Straggler Resilience -- 4.3 Reducing Communication and Computation -- 5 From Semi-honest to Malicious Security -- 5.1 Privacy in the Presence of Malicious Adversaries -- 5.2 Verifying Correctness of the Computation -- 5.3 Putting It All Together - The Main Protocol -- References -- Blockchains Enable Non-interactive MPC -- 1 Introduction -- 1.1 Our Results -- 1.2 Technical Overview -- 1.3 Related Work -- 2 Preliminaries - CSaRs -- 3 Our Non-interactive MPC Construction -- 3.1 Construction Overview -- 4 Optimizations -- 5 Optimizing Communication and State Complexity in MPC -- 5.1 Step. 1: MPC with Semi-malicious Security -- 5.2 Step. 2: MPC with Fully Malicious Security -- 5.3 Properties of the Resulting MPC Construction -- 6 Guaranteed Output Delivery -- References -- Multi-party PSM, Revisited: -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Proof Overview -- 1.3 Related Works -- 2 Preliminaries -- 2.1 Tensor -- 2.2 Private Simultaneous Messages -- 2.3 Randomized Encoding -- 3 New Multi-party PSM Protocols -- 3.1 A Framework for Multi-party PSM -- 3.2 The Induced PSM Protocol -- 3.3 When k is Small -- 3.4 When k+1 is a Prime Power -- 4 Unbalanced 2-Party PSM Protocols -- 4.1 A Framework for 2-Party PSM -- 4.2 The Induced PSM Protocol -- 4.3 When Has a Small Denominator -- 5 Open Problems -- A Proof of Eq. (9) and (10) -- B Auxiliary PSM Protocols for "426830A x1 …xk, Y "526930B + s -- B.1 The Multi-party Variant -- B.2 The 2-party Variant -- References.
Multi-Party Functional Encryption -- 1 Introduction -- 1.1 Unifying the View: Multi-Party Functional Encryption -- 1.2 Comparison with Prior Work -- 1.3 New Constructions -- 1.4 Technical Overview -- 1.5 Predicting New and Useful Primitives via MPFE -- 2 Multi-Party Functional Encryption -- 3 Multi-Authority ABE IPFE for LSSS Access Structures -- 3.1 Specializing the MPFE Syntax -- 3.2 Construction -- 3.3 Correctness and Security -- 4 Function-Hiding DDFE for Inner Products -- 4.1 Specializing the MPFE Syntax -- 4.2 Construction of Function-Hiding IP-MCFE -- 4.3 Construction of Function-Hiding IP-DDFE -- References -- Succinct LWE Sampling, Random Polynomials, and Obfuscation -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview -- 1.3 Discussion -- 2 Preliminaries -- 2.1 Notations -- 2.2 Learning with Errors -- 2.3 Lattice Tools -- 2.4 Homomorphic Operations -- 2.5 Succinct Randomized Encodings -- 3 Succinct LWE Sampler: Definition and Amplification -- 3.1 Definition and Discussion -- 3.2 Weak Succinct LWE Samplers -- 3.3 Amplification -- 4 Candidate Succinct LWE Sampler -- 4.1 A Basic Framework -- 4.2 Correctness, Succinctness, and LWE with Respect to A* -- 4.3 Instantiating the Parameters -- 4.4 Alternate Candidate Construction -- 4.5 Cryptanalysis -- 4.6 Cryptanalytic Challenges -- 5 Our Succinct Randomized Encoding Construction -- 5.1 Security -- References -- ABE for DFA from LWE Against Bounded Collusions, Revisited*-8pt -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Technical Overview I: T1/2 -- 1.3 Technical Overview II: ABE for DFA -- 1.4 Prior Works -- 1.5 Discussion -- 2 Preliminaries -- 2.1 Attribute-Based Encryption -- 2.2 Lattices Background -- 3 Trapdoor Sampling with T1/2 and a Computational Lemma -- 3.1 LWE Implies T1/2-LWE -- 3.2 Trapdoor Sampling with T1/2 -- 4 ABE for DFA Against Bounded Collusions.
4.1 Our Scheme -- 4.2 sk-Selective Security -- 5 Candidate ABE for DFA Against Unbounded Collusions -- References -- Distributed Merkle's Puzzles -- 1 Introduction -- 1.1 Distributed Key Agreement Based on Symmetric-Key Primitives -- 1.2 Our Results -- 1.3 Overview of the Protocol and Its Analysis -- 1.4 Previous Work -- 2 Preliminaries -- 2.1 Graphs -- 2.2 Random Functions and Encryption -- 3 Distributed Key Agreement Protocols Based on Random Oracles -- 4 The Setup Protocol -- 4.1 Correctness -- 4.2 Query and Communication Complexity -- 4.3 Connectivity -- 4.4 Security -- 5 The Distributed Key Agreement Protocol -- 5.1 Security Analysis -- 5.2 Main Theorem -- 6 Optimality of the Distributed Key Agreement Protocol -- 7 Extensions -- 7.1 The Semi-honest Model -- 7.2 Communication-Security Tradeoff -- References -- Continuously Non-malleable Secret Sharing: Joint Tampering, Plain Model and Capacity -- 1 Introduction -- 1.1 Non-malleability Against Joint Tampering -- 1.2 Our Results -- 1.3 Overview of Techniques -- 1.4 Related Work -- 2 Standard Definitions -- 2.1 Non-interactive Commitment Schemes -- 2.2 Symmetric Encryption -- 2.3 Information Dispersal -- 3 Secret Sharing Schemes -- 3.1 Tampering and Leakage Model -- 3.2 Related Notions -- 4 Rate-Zero Continuously Non-malleable Secret Sharing -- 4.1 Induction Basis -- 4.2 Inductive Step -- 4.3 Putting It Together -- 5 Rate Compilers and Capacity Upper Bounds -- 5.1 Capacity Upper Bounds -- 5.2 Rate Compiler (Plain Model) -- 6 Instantiations -- 6.1 Leakage-Resilient p-time Non-malleable Code -- 6.2 Leakage-Resilient Continuously Non-malleable Secret Sharing -- 6.3 Breaking the Rate-One Barrier -- References -- Disappearing Cryptography in the Bounded Storage Model -- 1 Introduction -- 1.1 Motivating Examples -- 1.2 Our Results -- 1.3 Defining Obfuscation in the Bounded Storage Model.
1.4 Applications.
Record Nr. UNINA-9910508455303321
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings : part III / / edited by Kobbi Nissim and Brent Waters
Theory of cryptography : 19th international conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings : part III / / edited by Kobbi Nissim and Brent Waters
Pubbl/distr/stampa Cham, Switzerland : , : Springer, , [2021]
Descrizione fisica 1 online resource (525 pages)
Disciplina 005.824
Collana Lecture Notes in Computer Science
Soggetto topico Computer security
Data encryption (Computer science)
Computer networks
ISBN 3-030-90456-3
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- Preface -- Organization -- Contents - Part III -- Covert Learning: How to Learn with an Untrusted Intermediary -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Real World Applications -- 1.3 Related Work -- 2 Covert Learning -- 2.1 Preliminaries -- 2.2 Definition of Covert Learning -- 2.3 A Warm-Up: Covert Learning of Noisy Parity Functions -- 2.4 Covert Learning of Low-Degree Fourier Coefficients -- 2.5 Covert Learning of Polynomial Size Decision Trees -- 3 Covert Verifiable Learning -- 3.1 Definition of Covert Verifiable Learning -- 3.2 Making CLF Verifiable -- 3.3 Making CLDT Verifiable -- 3.4 Verifiability Without Secret Examples -- References -- Random-Index PIR and Applications -- 1 Introduction -- 1.1 Random-Index PIR (RPIR) -- 1.2 Applications -- 1.3 Batch RPIR -- 1.4 Multi-server RPIR -- 1.5 Organization -- 2 Random-Index Private Information Retrieval -- 2.1 Background: Private Information Retrieval -- 2.2 Defining RPIR -- 2.3 Defining Multi-server RPIR -- 2.4 RPIR is equivalent to PIR -- 3 RPIR Protocols -- 3.1 Noninteractive RPIR -- 3.2 Multi-server RPIR Protocols -- 4 Applications to Large-Scale DoS-Resistant Computation -- 4.1 Target Anonymous Communication Channels from RPIR -- 5 Batch RPIR -- 5.1 Definitions -- 5.2 Constructions -- A Random-Index Oblivious-RAM -- A.1 Target Anonymous Channels from RORAM -- B Target Anonymous Channels from Mix-Nets -- References -- Forward Secret Encrypted RAM: Lower Bounds and Applications -- 1 Introduction -- 1.1 Our Main Result: Lower Bound -- 1.2 ``Bypassing'' the Lower Bound -- 2 Lower Bound Model -- 2.1 Framework for Symbolic Private Data Structure Lower Bounds -- 2.2 Symbolic Definitions for Allowed Primitives -- 2.3 FS eRAM Symbolic Definition -- 3 Forward Secret Encrypted RAM Lower Bound -- 3.1 Minimality and Usefulness -- 3.2 Key-Data Graph -- 3.3 Adversarial Strategy.
4 Stronger Forward Secret Encrypted RAM Definitions -- 5 Oblivious Forward Secret Encrypted RAM -- 5.1 Definitions -- 5.2 Oblivious Forward Secret Encrypted RAM Construction -- 6 Forward Secret Memory Checkers -- 6.1 Forward Secret Memory Checker Definition -- 6.2 Forward Secret Memory Checker Construction -- References -- Laconic Private Set Intersection and Applications -- 1 Introduction -- 1.1 Our Results -- 1.2 Previous Work -- 1.3 Open Problems -- 2 Technical Overview -- 2.1 Semi-Honest PSI from CDH/LWE -- 2.2 Reusable Laconic PSI -- 2.3 DV-NIZK Range Proofs for DJ Ciphertexts -- 2.4 Labeled Laconic PSI and Laconic OT -- 3 Preliminaries -- 3.1 Hardness Assumptions -- 3.2 Laconic Private Set Intersection -- 4 Semi-Honest Laconic PSI from CDH/LWE -- 5 Reusable DV-NIZK Range Proofs for DJ Ciphertexts -- 5.1 Equality of Plaintexts in DJ and BGN Ciphertexts -- 5.2 DV-NIZK for Range Proofs of DJ Ciphertexts with Equal Discrete Log -- 6 Reusable Laconic Private Set Intersection -- 7 Self-Detecting Encryption -- References -- Amortizing Rate-1 OT and Applications to PIR and PSI -- 1 Introduction -- 1.1 Our Results -- 1.2 Applications -- 1.3 Comparison with Prior Work -- 2 Technical Overview -- 3 Preliminaries and Definitions -- 3.1 Amortized Rate-1 OT: Definition -- 4 Amortized Rate-1 OT from SXDH -- 4.1 Our Construction -- 4.2 Receiver Privacy -- 5 Amortized Rate-1 OT from Bilinear Power DDH -- 5.1 Receiver Privacy -- 6 Optimization -- 6.1 Delayed Pairing -- 6.2 Increasing Vector Dimension -- 7 Applications -- 7.1 Secure Function Evaluation on Branching Programs -- 7.2 PSI and PIR -- 7.3 Optimization for PSI and PSI-Cardinality -- 7.4 Other Variants of PSI and PIR -- 8 Amortized Rate-1 OT with Strong Sender Privacy -- References -- Ring-Based Identity Based Encryption - Asymptotically Shorter MPK and Tighter Security -- 1 Introduction.
1.1 Our Contributions -- 1.2 Technical Overview -- 2 Preliminaries -- 2.1 Identity-Based Encryption (IBE) -- 2.2 Concrete Bit-Security -- 2.3 Lattices and Gaussian Distributions -- 2.4 Rings and Ideal Lattices -- 3 New Homomorphic Equality Test and Tighter Analysis -- 3.1 Homomorphic Equality Testing -- 3.2 Our Construction -- 3.3 An Optimization with Tighter Analysis -- 3.4 Application to Packing/Unpacking Homomorphic Encodings -- 4 New Partition Function and Homomorphic Evaluation -- 4.1 Our New Hash Function Family -- 4.2 Homomorphic Evaluation of the Partitioning Function -- 5 IBE Design and Analysis -- 5.1 Construction -- 5.2 Security -- 5.3 Asymptotic and Concrete Parameters -- References -- Cryptographic Shallots: A Formal Treatment of Repliable Onion Encryption -- 1 Introduction -- 2 Repliable Onion Encryption: Syntax and Correctness -- 2.1 Onion Evolutions, Forward Paths, Return Paths and Layerings -- 3 FROES: Onion Routing in the SUC Framework -- 3.1 Ideal Functionality FROES -- 3.2 SUC-realizability of FROES -- 4 Repliable-Onion Security: A Game-Based Definition -- 5 Repliable-Onion Security SUC-Realizability of FROES -- 6 Shallot Encryption -- 7 Shallot Encryption Scheme Is Secure -- A Security Game for Variants (b) and (c) -- References -- Grafting Key Trees: Efficient Key Management for Overlapping Groups -- 1 Introduction -- 1.1 The Asymptotic Setting -- 1.2 The Non-asymptotic Setting -- 1.3 Related Work -- 2 Preliminaries -- 2.1 Notation -- 2.2 Huffman Codes -- 3 Key-Derivation Graphs for Multiple Groups -- 3.1 Continuous Group-Key Agreement and Multicast Encryption -- 3.2 Key-Derivation Graphs -- 3.3 Security -- 3.4 The Trivial Algorithm -- 4 Key-Derivation Graphs in the Asymptotic Setting -- 4.1 Key-Derivation Graphs in the Asymptotic Setting -- 4.2 Update Cost for Concrete Group Systems.
5 A Greedy Algorithm Based on Huffman Codes -- 5.1 Algorithm Description -- 5.2 Total Update Cost -- 5.3 Asymptotic Optimality of Boolean-Lattice Based Graphs -- 6 Lower Bound on the Update Cost of CGKA -- 6.1 Symbolic Model -- 6.2 Lower Bound on the Average Update Cost -- 7 Open Problems -- 7.1 Optimal Key-Derivation Graphs -- 7.2 Security -- 7.3 Efficiency of Dynamic Operations -- References -- Updatable Public Key Encryption in the Standard Model -- 1 Introduction -- 1.1 Our Technique: Using Circular Security and Leakage-Resilience -- 1.2 Additional Theoretical Contributions -- 1.3 Related Work -- 2 Preliminaries -- 3 Updatable Public Key Encryption (UPKE) -- 3.1 IND-CR-CPA Security of UPKE -- 4 Key-Dependent-Message-Secure Encryption Scheme -- 5 DDH Based Construction -- 5.1 The BHHO Cryptosystem -- 5.2 CS+LR Security of BHHO Cryptosystem -- 5.3 UPKE Construction -- 5.4 Security of the UPKE Construction -- 6 Constructions Based on LWE -- 6.1 The Dual Regev or GPV Cryptosystem -- 6.2 CS+LR Security of the Dual-Regev Cryptosystem -- 6.3 UPKE Construction -- 6.4 Security of the UPKE Construction -- 7 Towards Stronger Security -- References -- Towards Tight Adaptive Security of Non-interactive Key Exchange -- 1 Introduction -- 1.1 Technical Overview -- 2 Preliminaries -- 2.1 Pairing Group Assumptions -- 2.2 Non-Interactive Key Exchange -- 3 An Inner-Product-Based NIKE Scheme -- 4 Lower Bound -- 4.1 Lower Bound for Inner-product NIKEs -- References -- On the Impossibility of Purely Algebraic Signatures -- 1 Introduction -- 1.1 Related Work -- 1.2 Technical Outline -- 2 Preliminaries -- 2.1 Notation -- 2.2 Generic Group Model -- 2.3 Signatures -- 3 Signature Schemes over Groups of Prime Order -- 3.1 Algebraic Signatures -- 3.2 Preparation -- 3.3 Impossibility of Secure Algebraic Signatures -- 4 Signature Schemes over Groups of Unknown Order.
4.1 Simplified Algebraic Signatures -- 4.2 Hermite Normal Form -- 4.3 An Inefficient AddColumn Procedure for Matrices in HNF -- 4.4 Impossibility of Simplified Algebraic Signatures -- 5 Extension: BLS Signatures Instantiated with Algebraic Hash Functions Are Insecure -- References -- Policy-Compliant Signatures -- 1 Introduction -- 1.1 Applications of PCS -- 1.2 Our Contributions and Organization of this Paper -- 1.3 Related Work -- 2 Preliminaries -- 3 Policy-Compliant Signatures -- 3.1 Adversarial Capabilities in the Security Games -- 3.2 Existential Unforgeability -- 3.3 Indistinguishability-Based Attribute Hiding -- 4 Construction of a Policy-Compliant Signature Scheme -- 4.1 The Scheme -- 4.2 Correctness -- 4.3 Existential Unforgeability -- 4.4 Indistinguishability-Based Attribute Hiding -- 4.5 Efficient Instantiations Based on Inner-Product PE -- 5 Universal Composability and SIM-Based PCS -- 5.1 Simulation-Based Attribute Hiding -- 5.2 On the SIM-Based Security of our Generic Scheme -- References -- Simple and Efficient Batch Verification Techniques for Verifiable Delay Functions -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Additional Related Work and Open Problems -- 1.3 Technical Overview -- 1.4 Paper Organization -- 2 Preliminaries -- 3 Succinct Proofs of Correct Exponentiation -- 3.1 The Basic Definition -- 3.2 Batch Proofs of Correct Exponentiation -- 4 Warm-Up: The Random Subset Compiler -- 5 Amplifying Soundness and Reducing Communication -- 6 An Improved Compiler from the Low Order Assumption -- 6.1 The Compiler -- 6.2 Soundness Analysis Based on the Low Order Assumption -- References -- Non-malleable Vector Commitments via Local Equivocability -- 1 Introduction -- 1.1 Our Contributions -- 1.2 Applications -- 1.3 Overview of Our Approach -- 1.4 Open Problems -- 1.5 Paper Organization -- 2 Preliminaries.
2.1 Equivocable Commitment Schemes.
Record Nr. UNISA-996464418403316
Cham, Switzerland : , : Springer, , [2021]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui