國立虎尾科技大學 |

Theory of Cryptography = 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Theory of Cryptography/ edited by Rafael Pass, Krzysztof Pietrzak.
其他題名:	18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I /
其他作者:	Pietrzak, Krzysztof.
面頁冊數:	XVI, 707 p. 54 illus., 3 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer Communication Networks. -
電子資源:	https://doi.org/10.1007/978-3-030-64375-1
ISBN:	9783030643751

Theory of Cryptography = 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I /
Theory of Cryptography18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I /[electronic resource] :edited by Rafael Pass, Krzysztof Pietrzak. - 1st ed. 2020. - XVI, 707 p. 54 illus., 3 illus. in color.online resource. - Security and Cryptology ;12550. - Security and Cryptology ;9241.

Lossiness and Entropic Hardness for Ring-LWE -- Multi-key Fully-Homomorphic Encryption in the Plain Model -- Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions -- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and CP-ABE for Circuits (and more) in the Symmetric Key Setting -- Optimal Broadcast Encryption from LWE and Pairings in the Standard Model -- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark) -- Functional Encryption for Quadratic Functions from k-Lin, Revisited -- On Perfect Correctness in (Lockable) Obfuscation -- Can a Public Blockchain Keep a Secret -- Blockchains from Non-Idealized Hash Functions -- Ledger Combiners for Fast Asynchronous Byzantine Agreement with Subquadratic Communication -- Expected Constant Round Byzantine Broadcast under Dishonest Majority -- Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions -- A Lower Bound for One-Round Oblivious RAM -- Lower Bounds for Multi-Server Oblivious RAMs -- On Computational Shortcuts for Information-Theoretic PIR -- Characterizing Deterministic-Prover Zero Knowledge -- NIZK from SNARG -- Weakly Extractable One-Way Functions -- Towards Non-Interactive Witness Hiding -- FHE-Based Bootstrapping of Designated-Prover NIZK -- Perfect Zero Knowledge: New Upperbounds and Relativized Separations.

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

ISBN: 9783030643751

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

669310
Computer Communication Networks.

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Theory of Cryptography = 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I /
LDR:03758nam a22004215i 4500 001 1030816
003 DE-He213
005 20201214113622.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030643751 $9 978-3-030-64375-1
024 7 $a 10.1007/978-3-030-64375-1 $2 doi
035 $a 978-3-030-64375-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 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I / $c edited by Rafael Pass, Krzysztof Pietrzak.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XVI, 707 p. 54 illus., 3 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 12550
505 0 $a Lossiness and Entropic Hardness for Ring-LWE -- Multi-key Fully-Homomorphic Encryption in the Plain Model -- Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions -- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and CP-ABE for Circuits (and more) in the Symmetric Key Setting -- Optimal Broadcast Encryption from LWE and Pairings in the Standard Model -- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark) -- Functional Encryption for Quadratic Functions from k-Lin, Revisited -- On Perfect Correctness in (Lockable) Obfuscation -- Can a Public Blockchain Keep a Secret -- Blockchains from Non-Idealized Hash Functions -- Ledger Combiners for Fast Asynchronous Byzantine Agreement with Subquadratic Communication -- Expected Constant Round Byzantine Broadcast under Dishonest Majority -- Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions -- A Lower Bound for One-Round Oblivious RAM -- Lower Bounds for Multi-Server Oblivious RAMs -- On Computational Shortcuts for Information-Theoretic PIR -- Characterizing Deterministic-Prover Zero Knowledge -- NIZK from SNARG -- Weakly Extractable One-Way Functions -- Towards Non-Interactive Witness Hiding -- FHE-Based Bootstrapping of Designated-Prover NIZK -- Perfect Zero Knowledge: New Upperbounds and Relativized Separations.
520 $a This 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.
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Security Services. $3 1211616
650 2 4 $a Mobile and Network Security. $3 1211619
650 1 4 $a Cryptology. $3 1211076
650 0 $a Computer communication systems. $3 1115394
650 0 $a Information theory. $3 595305
650 0 $a Coding theory. $3 561460
650 0 $a Computer security. $3 557122
650 0 $a Computer networks $x Security measures. $3 555385
650 0 $a Data encryption (Computer science). $3 1051084
700 1 $a Pietrzak, Krzysztof. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1327787
700 1 $a Pass, Rafael. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1327786
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030643744
776 0 8 $i Printed edition: $z 9783030643768
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-64375-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)