國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory of cryptography18th Internati...

(1998 :)

Theory of cryptography18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings.Part I /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory of cryptographyedited by Rafael Pass, Krzysztof Pietrzak.
其他題名:	18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings.
其他題名:	TCC 2020
其他作者:	Pass, Rafael.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xvi, 707 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-64375-1
ISBN:	9783030643751$q(electronic bk.)

Theory of cryptography18th 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] :TCC 2020edited by Rafael Pass, Krzysztof Pietrzak. - Cham :Springer International Publishing :2020. - xvi, 707 p. :ill., digital ;24 cm. - Lecture notes in computer science,125500302-9743 ;. - Lecture notes in computer science ;4891..

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

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

184520
Data encryption (Computer science)

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.824

Theory of cryptography18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings.Part I /
LDR:03491nmm a2200373 a 4500 001 591419
003 DE-He213
005 20201214113622.0
006 m d
007 cr nn 008maaau
008 210629s2020 sz s 0 eng d
020 $a 9783030643751$q(electronic bk.)
020 $a 9783030643744$q(paper)
024 7 $a 10.1007/978-3-030-64375-1 $2 doi
035 $a 978-3-030-64375-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25
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 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Theory of cryptography $h [electronic resource] : $b 18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings. $n Part I / $c edited by Rafael Pass, Krzysztof Pietrzak.
246 3 $a TCC 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xvi, 707 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12550
490 1 $a Security and cryptology
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 0 $a Data encryption (Computer science) $3 184520
650 1 4 $a Cryptology. $3 825728
650 2 4 $a Mobile and Network Security. $3 825732
650 2 4 $a Security Services. $3 825729
650 2 4 $a Systems and Data Security. $3 274481
650 2 4 $a Coding and Information Theory. $3 273763
650 2 4 $a Computer Communication Networks. $3 218087
700 1 $a Pass, Rafael. $3 882895
700 1 $a Pietrzak, Krzysztof. $3 882896
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-64375-1
950 $a Computer Science (SpringerNature-11645)