國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory of cryptography19th Internati...

(1998 :)

Theory of cryptography19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.Part II /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory of cryptographyedited by Kobbi Nissim, Brent Waters.
其他題名:	19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.
其他題名:	TCC 2021
其他作者:	Nissim, Kobbi.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xii, 753 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-90453-1
ISBN:	9783030904531$q(electronic bk.)

Theory of cryptography19th 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] :TCC 2021edited by Kobbi Nissim, Brent Waters. - Cham :Springer International Publishing :2021. - xii, 753 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,130430302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

184520
Data encryption (Computer science)

LC Class. No.: QA76.9.A25 / T44 2021

Dewey Class. No.: 005.824

Theory of cryptography19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.Part II /
LDR:03324nmm 22003735a 4500 001 613873
003 DE-He213
005 20211104142617.0
006 m d
007 cr nn 008maaau
008 220627s2021 sz s 0 eng d
020 $a 9783030904531$q(electronic bk.)
020 $a 9783030904524$q(paper)
024 7 $a 10.1007/978-3-030-90453-1 $2 doi
035 $a 978-3-030-90453-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25 $b T44 2021
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.824 $2 23
090 $a QA76.9.A25 $b T396 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Theory of cryptography $h [electronic resource] : $b 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings. $n Part II / $c edited by Kobbi Nissim, Brent Waters.
246 3 $a TCC 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xii, 753 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13043
490 1 $a Security and cryptology
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 0 $a Data encryption (Computer science) $3 184520
650 0 $a Computer networks $x Security measures $v Congresses. $3 384553
650 1 4 $a Cryptology. $3 825728
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Information Systems and Communication Service. $3 274025
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Mobile and Network Security. $3 825732
700 1 $a Nissim, Kobbi. $3 911945
700 1 $a Waters, Brent R. $3 227961
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Security and cryptology. $3 822028
856 4 0 $u https://doi.org/10.1007/978-3-030-90453-1
950 $a Computer Science (SpringerNature-11645)