000958950 000__ 04923cam\a2200625Ii\4500
000958950 001__ 958950
000958950 005__ 20230306152629.0
000958950 006__ m\\\\\o\\d\\\\\\\\
000958950 007__ cr\nn\nnnunnun
000958950 008__ 201212s2020\\\\sz\a\\\\o\\\\\101\0\eng\d
000958950 019__ $$a1228843407
000958950 020__ $$a9783030643782$$q(electronic book)
000958950 020__ $$a3030643786$$q(electronic book)
000958950 020__ $$z9783030643775
000958950 0247_ $$a10.1007/978-3-030-64378-2$$2doi
000958950 035__ $$aSP(OCoLC)on1228649009
000958950 035__ $$aSP(OCoLC)1228649009$$z(OCoLC)1228843407
000958950 040__ $$aSFB$$beng$$erda$$cSFB$$dOCLCO$$dOCLCF$$dGW5XE$$dOCLCO$$dUPM
000958950 049__ $$aISEA
000958950 050_4 $$aQA76.9.A25
000958950 08204 $$a005.8/24$$223
000958950 1112_ $$aTheory of Cryptography Conference$$n(18th :$$d2020 :$$cOnline)
000958950 24510 $$aTheory of Cryptography :$$b18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings.$$nPart II /$$cRafael Pass, Krzysztof Pietrzak (eds.).
000958950 24630 $$aTCC 2020
000958950 264_1 $$aCham :$$bSpringer,$$c[2020]
000958950 300__ $$a1 online resource (xii, 715 pages) :$$billustrations.
000958950 336__ $$atext$$btxt$$2rdacontent
000958950 337__ $$acomputer$$bc$$2rdamedia
000958950 338__ $$aonline resource$$bcr$$2rdacarrier
000958950 347__ $$atext file
000958950 347__ $$bPDF
000958950 4901_ $$aLecture notes in computer science ;$$v12551
000958950 4901_ $$aLNCS sublibrary: SL4 - security and cryptology
000958950 500__ $$aInternational conference proceedings.
000958950 500__ $$a"The 18th Theory of Cryptography Conference (TCC 2020) was held virtually during November 16-19, 2020"--Preface.
000958950 500__ $$aIncludes author index.
000958950 5050_ $$aProof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- Synchronous Constructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model.
000958950 506__ $$aAccess limited to authorized users.
000958950 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.
000958950 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed February 12, 2021).
000958950 650_0 $$aData encryption (Computer science)$$vCongresses.
000958950 650_0 $$aSoftware engineering.
000958950 650_0 $$aData structures (Computer science)
000958950 650_0 $$aComputer networks$$xSecurity measures.
000958950 650_0 $$aComputer security.
000958950 650_0 $$aComputer networks.
000958950 7001_ $$aPass, Rafael,$$eeditor.
000958950 7001_ $$aPietrzak, Krzysztof,$$eeditor.
000958950 77608 $$z3030643778
000958950 830_0 $$aLecture notes in computer science ;$$v12551.
000958950 830_0 $$aLNCS sublibrary.$$nSL 4,$$pSecurity and cryptology.
000958950 852__ $$bebk
000958950 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-64378-2$$zOnline Access$$91397441.1
000958950 909CO $$ooai:library.usi.edu:958950$$pGLOBAL_SET
000958950 980__ $$aEBOOK
000958950 980__ $$aBIB
000958950 982__ $$aEbook
000958950 983__ $$aOnline
000958950 994__ $$a92$$bISE