國立虎尾科技大學 |

Theory of Cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Theory of Cryptography/ edited by Kobbi Nissim, Brent Waters.
其他題名:	19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /
其他作者:	Waters, Brent.
面頁冊數:	XII, 753 p. 64 illus., 30 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mobile and Network Security. -
電子資源:	https://doi.org/10.1007/978-3-030-90453-1
ISBN:	9783030904531

Theory of Cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /
Theory of Cryptography19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /[electronic resource] :edited by Kobbi Nissim, Brent Waters. - 1st ed. 2021. - XII, 753 p. 64 illus., 30 illus. in color.online resource. - Security and Cryptology ;13043. - Security and Cryptology ;9241.

Dory: 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.-.

The 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.

ISBN: 9783030904531

Standard No.: 10.1007/978-3-030-90453-1doiSubjects--Topical Terms:

1211619
Mobile and Network Security.

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Theory of Cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II /
LDR:03572nam a22004215i 4500 001 1056951
003 DE-He213
005 20211104142617.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030904531 $9 978-3-030-90453-1
024 7 $a 10.1007/978-3-030-90453-1 $2 doi
035 $a 978-3-030-90453-1
050 4 $a QA76.9.D335
072 7 $a GPJ $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a GPJ $2 thema
072 7 $a URY $2 thema
082 0 4 $a 005.82 $2 23
245 1 0 $a Theory of Cryptography $h [electronic resource] : $b 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part II / $c edited by Kobbi Nissim, Brent Waters.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XII, 753 p. 64 illus., 30 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Security and Cryptology ; $v 13043
505 0 $a Dory: 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 $a The 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 2 4 $a Mobile and Network Security. $3 1211619
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
650 2 4 $a Information Systems and Communication Service. $3 669203
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Cryptology. $3 1211076
650 0 $a Computer networks $x Security measures. $3 555385
650 0 $a Computer organization. $3 596298
650 0 $a Computers. $3 565115
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Data encryption (Computer science). $3 1051084
700 1 $a Waters, Brent. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 793765
700 1 $a Nissim, Kobbi. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1362343
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030904524
776 0 8 $i Printed edition: $z 9783030904548
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-90453-1
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)