Theory of Cryptography

17th International Conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019, Proceedings, Part I

AvDennis Hofheinz,Alon Rosen

Häftad, Engelska, 2019

Del 11891 i serien Lecture Notes in Computer Science

577 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2019-11-23
Mått:155 x 235 x 33 mm
Vikt:914 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:598
Förlag:Springer Nature Switzerland AG
ISBN:9783030360290

Utforska kategorier

Referensverk och tvärvetenskap inom Samhälle och politik
Hårdvara inom Data och IT
Tillämpad datateknik inom Data och IT

Innehållsförteckning

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.- TheFunction-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.