Theory of cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings
Author(s)
Bibliographic Information
Theory of cryptography : 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019 : proceedings
(Lecture notes in computer science, 11891-11892 . LNCS sublibrary ; SL 4 . Security and cryptology)
Springer, c2019
- pt. 1
- pt. 2
Available at 1 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Tokyo Metropolitan University Library数学
pt. 1/549/L49c/1189110005481470,
pt. 2/549/L49c/1189210005481489
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
pt. 1 ISBN 9783030360290
Description
The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019.The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more.
Table of Contents
Algebraically Structured LWE, Revisited.- Lattice Trapdoors and IBE from Middle-Product LWE.- Matrix PRFs: Constructions, Attacks, and Applications to Obfuscation.- Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems.- A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement.- Synchronous Consensus with Optimal Asynchronous Fallback Guarantees.- Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank.- Optimal Bounded-Collusion Secure Functional Encryption.- From FE Combiners to Secure MPC and Back.- (Pseudo) Random Quantum States with Binary Phase.- General Linear Group Action on Tensors: A Candidate for Post-Quantum Cryptography.- Composable and Finite Computational Security of Quantum Message Transmission.- On Fully Secure MPC with Solitary Output.- Secure Computation with Preprocessing via Function Secret Sharing.- Efficient Private PEZ Protocols for Symmetric Functions.- The Function-Inversion Problem: Barriers and Opportunities.- On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations.- Characterizing Collision and Second-Preimage Resistance in Linicrypt.- Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings.- Is Information-Theoretic Topology-Hiding Computation Possible.- Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation.- On Perfectly Secure 2PC in the OT-Hybrid Model.
- Volume
-
pt. 2 ISBN 9783030360320
Description
The two-volume set LNCS 11891 and 11892 constitutes the proceedings of the 17th International Conference on Theory of Cryptography, TCC 2019, held in Nuremberg, Germany, in December 2019.The 43 full papers presented were carefully reviewed and selected from 147 submissions. The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them and much more.
Table of Contents
Succinct Arguments in the Quantum Random Oracle Model.- Delegating Quantum Computation in the Quantum Random Oracle Model.- Tighter proofs of CCA security in the quantum random oracle model.- Attribute Based Encryption for Deterministic Finite Automata from DLIN.- CPA-to-CCA Transformation for KDM Security.- New Approaches to Traitor Tracing with Embedded Identities.- A Unified and Composable Take on Ratcheting.- Continuously Non-Malleable Secret Sharing for General Access Structures.- Interactive Non-Malleable Codes.- Stronger Lower Bounds for Online ORAM.- Adaptively Secure Garbling Schemes for Parallel Computations.- Statistical Difference Beyond the Polarizing Regime.- Estimating Gaps in Martingales and Applications to Coin-Tossing: Constructions & Hardness.- Fully Homomorphic NIZK and NIWI Proofs.- Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.- Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.- Compressible FHE with Applications to PIR.- Permuted Puzzles and Cryptographic Hardness.- Linear-Size Constant-Query IOPs for Delegating Computation.- On the (In)security of Kilian-Based SNARGs.- Incrementally Verifiable Computation via Incremental PCPs.
by "Nielsen BookData"