Advances in cryptology -- CRYPTO 2017 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings. Part II /
The three volume-set, LNCS 10401, LNCS 10402, and LNCS 10403, constitutes the refereed proceedings of the 37th Annual International Cryptology Conference, CRYPTO 2017, held in Santa Barbara, CA, USA, in August 2017. The 72 revised full papers presented were carefully reviewed and selected from 311 s...
| Corporate Authors: | CRYPTO (Conference) Santa Barbara, Calif.) |
|---|---|
| Other Authors: | CRYPTO (Conference), Katz, Jonathan, 1974-, Shacham, Hovav,, SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Cham :
Springer,
2017.
|
| Physical Description: |
1 online resource (xv, 735 pages) : illustrations. |
| Series: |
Lecture notes in computer science ;
10402. LNCS sublibrary. Security and cryptology. |
| Subjects: |
Table of Contents:
- Intro; Preface; Crypto 2017 The 37th IACR International Cryptology Conference; Contents
- Part II; OT and ORAM; Secure Computation Based on Leaky Correlations: High Resilience Setting; 1 Introduction; 1.1 Model; 1.2 Our Contribution; 1.3 Prior Relevant Works; 1.4 Technical Overview; 2 Preliminaries; 2.1 Functionalities and Correlations; 2.2 Toeplitz Matrix Distribution; 2.3 Graph Representation of Correlations; 3 Extracting One OLE over a Large Field; 3.1 Extraction of One Secure [K] Correlation; 3.2 Securely Realizing [K] Using [K] Correlation.
- 4 Embedding Multiple s into an over an Extension Field4.1 Intuition of the Embedding; 4.2 Relevant Prior Work on 3-Free Sets; 4.3 Generating Explicit Embedding and Proof of Theorem 1; 5 Simple Partition Number; 5.1 Intuition of the Hardness of Computation Result; 5.2 Relevant Prior Work on Graph Covering Problems; 5.3 Relation to Leakage Resilience: Proof of Lemma 4; 5.4 Estimates of Simple Partition Number and Proof of Theorem 2; 5.5 Subsuming the Partition Argument; 5.6 Relevant Prior Work on Common Information and Assisted Common Information.
- 5.7 Analogy of Biclique Partition Number and Wyner's Common InformationReferences; Laconic Oblivious Transfer and Its Applications; 1 Introduction; 1.1 Laconic OT; 1.2 Warm-Up Application: Non-interactive Secure Computation on Large Inputs; 1.3 Main Application: Multi-hop Homomorphic Encryption for RAM Programs; 1.4 Roadmap; 2 Technical Overview; 2.1 Laconic OT; 2.2 Non-interactive Secure Computation on Large Inputs; 2.3 Multi-hop Homomorphic Encryption for RAM Programs; 3 Laconic Oblivious Transfer; 3.1 Laconic OT; 3.2 Updatable Laconic OT.
- 4 Laconic Oblivious Transfer with Factor-2 Compression4.1 Somewhere Statistically Binding Hash Functions and Hash Proof Systems; 4.2 HPS-friendly SSB Hashing; 4.3 A Hash Proof System for Knowledge of Preimage Bits; 4.4 The Laconic OT Scheme; 5 Construction of Updatable Laconic OT; 5.1 Background; 5.2 Construction Overview; References; Black-Box Parallel Garbled RAM; 1 Introduction; 1.1 Problem Statement; 1.2 Comparison with Previous Work; 1.3 Our Results; 1.4 Overview of New Ideas for Our Construction; 1.5 Roadmap; 2 Preliminaries; 2.1 Notation; 2.2 PRAM: Parallel RAM Programs.
- 2.3 Garbled Circuits2.4 Oblivious PRAM; 2.5 Garbled Parallel RAM; 3 Construction of Black-Box Parallel GRAM; 3.1 Overview; 3.2 Data Garbling: (, s) GData(1, D); 3.3 Program Garbling: (, sin) GProg(1, 1logN, 1t, s, told); 3.4 Input Garbling: GInput(1, x, sin); 3.5 Garbled Evaluation: y GEval(,); 4 Cost and Correctness Analysis; 4.1 Overall Cost; 4.2 Correctness; 5 Main Theorem; References; A UMA2-security Proof; B UMA2 to Full Security; Foundations II; Non-Malleable Codes for Space-Bounded Tampering; 1 Introduction; 1.1 Our Contribution; 1.2 Additional Related Work; 2 Preliminaries.