000 05610nam a22006735i 4500
001 978-3-030-56880-1
003 DE-He213
005 20240730170318.0
007 cr nn 008mamaa
008 200812s2020 sz | s |||| 0|eng d
020 _a9783030568801
_9978-3-030-56880-1
024 7 _a10.1007/978-3-030-56880-1
_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 _aAdvances in Cryptology - CRYPTO 2020
_h[electronic resource] :
_b40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part II /
_cedited by Daniele Micciancio, Thomas Ristenpart.
250 _a1st ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXV, 856 p. 737 illus., 27 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 ;
_v12171
505 0 _aPublic Key Cryptanalysis- A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem -- Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields -- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment -- Breaking the decisional Diffie-Hellman problem for class group actions using genus theory -- A Classification of Computational Assumptions in the Algebraic Group Model -- Lattice Algorithms and Cryptanalysis -- Fast reduction of algebraic lattices over cyclotomic fields -- Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)) -- Lattice Reduction for Modules, or How to Reduce ModuleSVP to ModuleSVP -- Random Self-reducibility of Ideal-SVP via Arakelov Random Walks -- Slide Reduction, Revisited,ÄîFilling the Gaps in SVP Approximation -- Rounding in the Rings -- Lattice-based and post-quantum cryptography -- LWE with Side Information: Attacks and Concrete Security Estimation -- A key-recovery timing attack on post-quantum primitives using the Fujisaki-Okamoto transformation and its application on FrodoKEM -- Efficient Pseudorandom Correlation Generators from Ring-LPN -- Scalable Pseudorandom Quantum States -- A non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge -- Practical Product Proofs for Lattice Commitments.-Lattice-Based Blind Signatures, Revisited -- Multi-Party Computation -- 12171 Round-optimal Black-box Commit-and-prove with Succinct Communication -- Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability -- Black-box use of One-way Functions is Useless for Optimal Fair Coin-Tossing -- Guaranteed Output Delivery Comes Free in Honest Majority MPC -- Black-Box Transformations from Passive to Covert Security with Public Verifiability -- MPC with Friends and Foes -- Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback -- Reverse Firewalls for Actively SecureMPCs -- Stacked Garbling: Garbled Circuit Proportional to Longest Execution Path -- Better Concrete Security for Half-Gates Garbling (in the Multi-Instance Setting) -- Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits.
520 _aConference on Cryptologic Research, CRYPTO 2020, which was held during August 17-21, 2020. Crypto has traditionally been held at UCSB every year, but due to the COVID-19 pandemic it will be an online event in 2020. The 85 papers presented in the proceedings were carefully reviewed and selected from a total of 371 submissions. They were organized in topical sections as follows: Part I: Security Models; Symmetric and Real World Cryptography; Hardware Security and Leakage Resilience; Outsourced encryption; Constructions. Part II: Public Key Cryptanalysis; Lattice Algorithms and Cryptanalysis; Lattice-based and Post Quantum Cryptography; Multi-Party Computation. Part III: Multi-Party Computation; Secret Sharing; Cryptanalysis; Delay functions; Zero Knowledge. .
650 0 _aCryptography.
_91973
650 0 _aData encryption (Computer science).
_99168
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer networks .
_931572
650 0 _aData protection.
_97245
650 0 _aApplication software.
_992800
650 0 _aSoftware engineering.
_94138
650 1 4 _aCryptology.
_931769
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aComputer Communication Networks.
_992801
650 2 4 _aData and Information Security.
_931990
650 2 4 _aComputer and Information Systems Applications.
_992802
650 2 4 _aSoftware Engineering.
_94138
700 1 _aMicciancio, Daniele.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992803
700 1 _aRistenpart, Thomas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992804
710 2 _aSpringerLink (Online service)
_992805
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030568795
776 0 8 _iPrinted edition:
_z9783030568818
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v12171
_992806
856 4 0 _uhttps://doi.org/10.1007/978-3-030-56880-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86843
_d86843