國立虎尾科技大學 |

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

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Theory of Cryptography/ edited by Rafael Pass, Krzysztof Pietrzak.
Reminder of title:	18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part II /
other author:	Pass, Rafael.
Description:	XII, 715 p. 139 illus., 25 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Data encryption (Computer science). -
Online resource:	https://doi.org/10.1007/978-3-030-64378-2
ISBN:	9783030643782

Theory of Cryptography = 18th 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] :edited by Rafael Pass, Krzysztof Pietrzak. - 1st ed. 2020. - XII, 715 p. 139 illus., 25 illus. in color.online resource. - Security and Cryptology ;12551. - Security and Cryptology ;9241.

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

Standard No.: 10.1007/978-3-030-64378-2doiSubjects--Topical Terms:

1051084
Data encryption (Computer science).

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 II /
LDR:03980nam a22004215i 4500 001 1030796
003 DE-He213
005 20201212154442.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030643782 $9 978-3-030-64378-2
024 7 $a 10.1007/978-3-030-64378-2 $2 doi
035 $a 978-3-030-64378-2
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 II / $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 XII, 715 p. 139 illus., 25 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 12551
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 1051084
650 0 $a Software engineering. $3 562952
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer networks $x Security measures. $3 555385
650 0 $a Computer security. $3 557122
650 0 $a Computer communication systems. $3 1115394
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Software Engineering/Programming and Operating Systems. $3 669780
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Mobile and Network Security. $3 1211619
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Pass, Rafael. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1327786
700 1 $a Pietrzak, Krzysztof. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1327787
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030643775
776 0 8 $i Printed edition: $z 9783030643799
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-64378-2
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)