UID:
almahu_9948621899702882
Format:
XII, 673 p. 395 illus., 11 illus. in color.
,
online resource.
Edition:
1st ed. 2020.
ISBN:
9783030643812
Series Statement:
Security and Cryptology ; 12552
Content:
This three-volume set, LNCS 12550, 12551, and 12552, constitutes the refereed proceedings of the 18th International Conference on Theory of Cryptography, TCCC 2020, held in Durham, NC, USA, in November 2020. The total of 71 full papers presented in this three-volume set was carefully reviewed and selected from 167 submissions. Amongst others they cover the following topics: study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization; discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones, formulation and treatment of new cryptographic problems; study of notions of security and relations among them; modeling and analysis of cryptographic algorithms; and study of the complexity assumptions used in cryptography. Due to the Corona pandemic this event was held virtually.
Note:
Universal Composition with Global Subroutines: Capturing Global Setup within plain UC -- Security analysis of SPAKE2+ -- Schrödinger's Pirate: How To Trace a Quantum Decoder -- Quantum Encryption with Certified Deletion -- Secure Quantum Extraction Protocols -- Non-interactive Classical Verification of Quantum Computation -- Classical Verification of Quantum Computations with Efficient Verifier -- Coupling of Random Systems -- Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity -- Zero-Communication Reductions -- Lower Bounds on the Time/Memory Tradeoff of Function Inversion -- Super-Linear Time-Memory Trade-Offs for Symmetric Encryption -- Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions -- On the Security of Time-Lock Puzzles and Timed Commitments -- Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness -- On the Complexity of Arithmetic Secret Sharing -- Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries -- The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs -- Transparent Error Correcting in a Computationally Bounded World -- New Techniques in Replica Encodings with Client Setup.
In:
Springer Nature eBook
Additional Edition:
Printed edition: ISBN 9783030643805
Additional Edition:
Printed edition: ISBN 9783030643829
Language:
English
DOI:
10.1007/978-3-030-64381-2
URL:
https://doi.org/10.1007/978-3-030-64381-2
