000 04472nam a22006495i 4500
001 978-3-030-90453-1
003 DE-He213
005 20240423125453.0
007 cr nn 008mamaa
008 211104s2021 sz | s |||| 0|eng d
020 _a9783030904531
_9978-3-030-90453-1
024 7 _a10.1007/978-3-030-90453-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 _aTheory of Cryptography
_h[electronic resource] :
_b19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /
_cedited by Kobbi Nissim, Brent Waters.
250 _a1st ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXII, 753 p. 64 illus., 30 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 ;
_v13043
505 0 _aDory: Efficient, Transparent arguments for Generalised Inner Products and Polynomial Commitments -- On Communication-E cient Asynchronous MPC with Adaptive Security -- Efficient Perfectly Secure Computation with Optimal Resilience -- On Communication Models and Best-Achievable Security in Two-Round MPC -- Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation -- Blockchains Enable Non-Interactive MPC -- Multi-party PSM, Revisited: Improved Communication and Unbalanced Communication -- Multi-Party Functional Encryption -- Succinct LWE Sampling, Random Polynomials, and Obfuscation -- ABE for DFA from LWE against Bounded Collusions, Revisited -- Distributed Merkle's Puzzles -- Continuously Non-Malleable Secret Sharing: Joint Tampering, Plain Model and Capacity -- Disappearing Cryptography in the Bounded Storage Model -- Trojan-Resilience without Cryptography -- On Derandomizing Yao's Weak-to-Strong OWF Construction -- Simple Constructions from (Almost) Regular One-Way Functions -- On Treewidth, Separators and Yao's Garbling -- Oblivious Transfer from Trapdoor Permutations in Minimal Rounds -- The Cost of Adaptivity in Security Games on Graphs -- Concurrent Composition of Differential Privacy -- Direct Product Hardness Amplifcation -- On the (Ir)Replaceability of Global Setups, or How (Not) to Use a Global Ledger -- BKW Meets Fourier: New Algorithms for LPN with Sparse Parities -- Computational Robust (Fuzzy) Extractors for CRS-dependent Sources with Minimal Min-entropy -- Polynomial-time targeted attacks on coin-tossing for any number of corruptions.-.
520 _aThe three-volume set LNCS 13042, LNCS 13043 and LNCS 13044 constitutes the refereed proceedings of the 19th International Conference on Theory of Cryptography, TCC 2021, held in Raleigh, NC, USA, in November 2021. The total of 66 full papers presented in this three-volume set was carefully reviewed and selected from 161 submissions. They cover topics on proof systems, attribute-based and functional encryption, obfuscation, key management and secure communication.
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aComputer engineering.
650 0 _aComputer networks .
650 0 _aComputer networks
_xSecurity measures.
650 1 4 _aCryptology.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aComputer Engineering and Networks.
650 2 4 _aComputer Engineering and Networks.
650 2 4 _aMobile and Network Security.
700 1 _aNissim, Kobbi.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aWaters, Brent.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030904524
776 0 8 _iPrinted edition:
_z9783030904548
830 0 _aSecurity and Cryptology,
_x2946-1863 ;
_v13043
856 4 0 _uhttps://doi.org/10.1007/978-3-030-90453-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c178290
_d178290