Advances in cryptology - CRYPTO 2019 : 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings

著者

    • Boldyreva, Alexandra
    • Micciancio, Daniele

書誌事項

Advances in cryptology - CRYPTO 2019 : 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019 : proceedings

Alexandra Boldyreva, Daniele Micciancio (eds.)

（Lecture notes in computer science, 11692-11694 . LNCS sublibrary ; SL 4 . Security and cryptology）

Springer, c2019

  • pt. 1
  • pt. 2
  • pt. 3

大学図書館所蔵 件 / 全1件

この図書・雑誌をさがす

注記

Includes bibliographical references and index

内容説明・目次

巻冊次

pt. 1 ISBN 9783030269470

内容説明

The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections: Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse. Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations. Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.

目次

Award Papers.- Cryptanalysis of OCB2: Attacks on Authenticity and Confidentiality.- Quantum cryptanalysis in the RAM model: Claw-finding attacks on SIKE.- Fully Secure Attribute-Based Encryption for t-CNF from LWE.- Lattice-Based ZK.- Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors.- Lattice-Based Zero-Knowledge Proofs: New Techniques for Shorter and Faster Constructions and Applications.- Efficient Lattice-Based Zero-Knowledge Arguments with Standard Soundness: Construction and Applications.- Algebraic Techniques for Short(er) Exact Lattice-Based Zero-Knowledge Proofs.- Symmetric Cryptography.- Seedless Fruit is the Sweetest: Random Number Generation, Revisited.- Nonces are Noticed: AEAD Revisited.- How to Build Pseudorandom Functions From Public Random Permutations.- Mathematical Cryptanalysis.- New Results on Modular Inversion Hidden Number Problem and Inversive Congruential Generator.- On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm.- Proofs of Storage.- Proofs of Replicated Storage Without Timing Assumptions.- Simple Proofs of Space-Time and Rational Proofs of Storage.- Non-Malleable Codes.- Non-Malleable Codes for Decision Trees.- Explicit Rate-1 Non-malleable Codes for Local Tampering.- Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space.- SNARKs and Blockchains.- Synchronous, with a Chance of Partition Tolerance.- Subvector Commitments with Application to Succinct Arguments.- Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains.- Homomorphic Cryptography.- On the Plausibility of Fully Homomorphic Encryption for RAMs.- Homomorphic Time-Lock Puzzles and Applications.- Symmetric Primitives with Structured Secrets.- Leakage Models and Key Reuse.- Unifying Leakage Models on a Renyi Day.- Leakage Certification Revisited: Bounding Model Errors in Side-Channel Security Evaluations.- Security in the Presence of Key Reuse: Context-Separable Interfaces and their Applications.
巻冊次

pt. 2 ISBN 9783030269500

内容説明

The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections: Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse. Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations. Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.

目次

MPC Communication Complexity.- The Communication Complexity of Threshold Private Set Intersection.- Adaptively Secure MPC with Sublinear Communication Complexity.- Communication Lower Bounds for Statistically Secure MPC, with or without Preprocessing.- Communication-Efficient Unconditional MPC with Guaranteed Output Delivery.- Symmetric Cryptanalysis.- Efficient Collision Attack Frameworks for RIPEMD-160.- Improving Attacks on Round-Reduced Speck32/64 Using Deep Learning.- Correlation of Quadratic Boolean Functions: Cryptanalysis of All Versions of Full MORUS.- Low Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem.- (Post) Quantum Cryptography.- How to Record Quantum Queries, and Applications to Quantum Indifferentiability.- Quantum security proofs using semi-classical oracles.- Quantum Indistinguishability of Random Sponges.- Revisiting Post-Quantum Fiat-Shamir.- Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model.- Leakage Resilience.- Unconditionally Secure Computation Against Low-Complexity Leakage.- Tight Leakage-Resilient CCA-Security from Quasi-Adaptive Hash Proof System.- Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate.- Leakage Resilient Secret Sharing and Applications.- Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.- Memory Hard Functions and Privacy Amplification.- Memory-Hard Functions from Cryptographic Primitives.- Data-Independent Memory Hard Functions: New Attacks and Stronger Constructions.- Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge.- The Privacy Blanket of the Shuffle Model.- Attribute Based Encryption.- Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption.- Match Me if You Can: Matchmaking Encryption and its Applications.- ABE for DFA from k-Lin.- Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE.- Foundations.- The Distinction Between Fixed and Random Generators in Group-Based Assumptions.- Unifying computational entropies via Kullback-Leibler divergence.
巻冊次

pt. 3 ISBN 9783030269531

内容説明

The three-volume set, LNCS 11692, LNCS 11693, and LNCS 11694, constitutes the refereed proceedings of the 39th Annual International Cryptology Conference, CRYPTO 2019, held in Santa Barbara, CA, USA, in August 2019. The 81 revised full papers presented were carefully reviewed and selected from 378 submissions. The papers are organized in the following topical sections: Part I: Award papers; lattice-based ZK; symmetric cryptography; mathematical cryptanalysis; proofs of storage; non-malleable codes; SNARKs and blockchains; homomorphic cryptography; leakage models and key reuse. Part II: MPC communication complexity; symmetric cryptanalysis; (post) quantum cryptography; leakage resilience; memory hard functions and privacy amplification; attribute based encryption; foundations. Part III: Trapdoor functions; zero knowledge I; signatures and messaging; obfuscation; watermarking; secure computation; various topics; zero knowledge II; key exchange and broadcast encryption.

目次

Trapdoor Functions.- Trapdoor Hash Functions and Their Applications.- CCA Security and Trapdoor Functions via Key-Dependent-Message Security.- Zero Knowledge I.- Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs.- Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge.- On Round Optimal Statistical Zero Knowledge Arguments.- Signatures and Messaging.- Repudiability and Claimability of Ring Signatures.- Two-Party ECDSA from Hash Proof Systems and Efficient Instantiations.- Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption.- Obfuscation.- Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map.- Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.- Watermarking.- Watermarking PRFs from Lattices: Stronger Security via Extractable PRFs.- Watermarking Public-Key Cryptographic Primitives.- Secure Computation.- SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension.- Universally Composable Secure Computation with Corrupted Tokens.- Reusable Non-Interactive Secure Computation.- Efficient Pseudorandom Correlation Generators: Silent OT Extension and More.- Various Topics.- Adaptively Secure and Succinct Functional Encryption: Improving Security and Efficiency, Simultaneously.- Non-Interactive Non-Malleability from Quantum Supremacy.- Cryptographic Sensing.- Public-Key Cryptography in the Fine-Grained Setting.- Zero Knowledge II.- Exploring Constructions of Compact NIZKs from Various Assumptions.- New Constructions of Reusable Designated-Verifier NIZKs.- Scalable Zero Knowledge with no Trusted Setup.- Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation.- Key Exchange and Broadcast Encryption.- Highly Efficient Key Exchange Protocols with Optimal Tightness.- Strong Asymmetric PAKE based on Trapdoor CKEM.- Broadcast and Trace with N Ciphertext Size from Standard Assumptions.-

「Nielsen BookData」 より

関連文献： 1件中  1-1を表示

詳細情報

ページトップへ