000 04586nam a22006615i 4500
001 978-3-030-64381-2
003 DE-He213
005 20240423125342.0
007 cr nn 008mamaa
008 201212s2020 sz | s |||| 0|eng d
020 _a9783030643812
_9978-3-030-64381-2
024 7 _a10.1007/978-3-030-64381-2
_2doi
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aTheory of Cryptography
_h[electronic resource] :
_b18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part III /
_cedited by Rafael Pass, Krzysztof Pietrzak.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXII, 673 p. 395 illus., 11 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSecurity and Cryptology,
_x2946-1863 ;
_v12552
505 0 _aUniversal 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 AlmostOptimal 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.
520 _aThis 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.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aApplication software.
650 0 _aComputer networks
_xSecurity measures.
650 0 _aData protection.
650 0 _aComputer networks .
650 0 _aComputer systems.
650 1 4 _aCryptology.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aMobile and Network Security.
650 2 4 _aData and Information Security.
650 2 4 _aComputer Communication Networks.
650 2 4 _aComputer System Implementation.
700 1 _aPass, Rafael.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPietrzak, Krzysztof.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030643805
776 0 8 _iPrinted edition:
_z9783030643829
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v12552
856 4 0 _uhttps://doi.org/10.1007/978-3-030-64381-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c177009
_d177009