國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory of cryptography18th Internati...

(1998 :)

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

紀錄類型:	書目-電子資源 : 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.
面頁冊數:	xii, 715 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-64378-2
ISBN:	9783030643782$q(electronic bk.)

Theory of cryptography18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings.Part II /
Theory of cryptography18th International Conference, TCC 2020, Durham, NC, USA, November 16-19, 2020 : proceedings.Part II /[electronic resource] :TCC 2020edited by Rafael Pass, Krzysztof Pietrzak. - Cham :Springer International Publishing :2020. - xii, 715 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,125510302-9743 ;. - Lecture notes in computer science ;4891..

Proof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- Synchronous Constructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model.

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

Standard No.: 10.1007/978-3-030-64378-2doiSubjects--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 II /
LDR:03723nmm a2200373 a 4500 001 591417
003 DE-He213
005 20201212154442.0
006 m d
007 cr nn 008maaau
008 210629s2020 sz s 0 eng d
020 $a 9783030643782$q(electronic bk.)
020 $a 9783030643775$q(paper)
024 7 $a 10.1007/978-3-030-64378-2 $2 doi
035 $a 978-3-030-64378-2
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 II / $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 xii, 715 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12551
490 1 $a Security and cryptology
505 0 $a Proof-Carrying Data from Accumulation Schemes -- Linear-Time Arguments with Sublinear Verification from Tensor Codes -- Barriers for Succinct Arguments in the Random Oracle Model -- Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction -- Batch Verification and Proofs of Proximity with Polylog Overhead -- Batch Verification for Statistical Zero Knowledge Proofs -- Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads -- On the Price of Concurrency in Group Ratcheting Protocols -- Stronger Security and Constructions of Multi-Designated Verifier Signatures -- Continuous Group Key Agreement with Active Security -- Round Optimal Secure Multiparty Computation from Minimal Assumptions -- Reusable Two-Round MPC from DDH -- Mr NISC: Multiparty Reusable Non-Interactive Secure Computation -- Secure Massively Parallel Computation for Dishonest Majority -- Towards Multiparty Computation Withstanding Coercion of All Parties -- Synchronous Constructive Cryptography -- Topology-Hiding Communication from Minimal Assumptions. -- Information-Theoretic 2-Round MPC without Round Collapsing: Adaptive Security, and More -- On Statistical Security in Two-Party Computation -- The Resiliency of MPC with Low Interaction: The Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures -- On the Power of an Honest Majority in Three-Party Computation Without Broadcast -- A Secret-Sharing Based MPC Protocol for Boolean Circuits with Good Amortized Complexity -- On the Round Complexity of the Shuffle Model.
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 Software Engineering/Programming and Operating Systems. $3 273711
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Mobile and Network Security. $3 825732
650 2 4 $a Systems and Data Security. $3 274481
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-64378-2
950 $a Computer Science (SpringerNature-11645)