東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Theory of cryptography = 19th Intern...

Theory of Cryptography Conference (2021 :)

FindBook

Google Book

Amazon

博客來

Theory of cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.. Part I /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theory of cryptography/ edited by Kobbi Nissim, Brent Waters.
其他題名:	19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.
其他題名:	TCC 2021
其他作者:	Nissim, Kobbi.
團體作者:	Theory of Cryptography Conference
出版者:	Cham :Springer International Publishing : : 2021.,
面頁冊數:	xvi, 785 p. :ill. (some col.), digital ;24 cm.
內容註:	Secure Quantum Computation with Classical Communication -- Secure Software Leasing from Standard Assumptions -- Post-quantum Resettably-Sound Zero Knowledge -- Secure Software Leasing Without Assumptions -- The Round Complexity of Quantum Zero-Knowledge -- Rate-1 Quantum Fully Homomorphic Encryption -- Unifying Presampling via Concentration Bounds -- Quantum Key-length Extension -- Relationships between quantum IND-CPA notions -- Classical Binding for Quantum Commitments -- Unclonable Encryption, Revisited -- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs -- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness -- Tight Security Bounds for Micali's SNARGs -- Acyclicity Programming for Sigma-Protocols -- Statistical ZAPs from Group-Based Assumptions -- Generalized Proofs of Knowledge with Fully Dynamic Setup -- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions -- On expected polynomial runtime in cryptography -- Information-Theoretically Secure MPC against Mixed Dynamic Adversaries -- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback -- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation -- Adaptive Security of Multi-Party Protocols, Revisited -- On Actively-Secure Elementary MPC Reductions -- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science) - Congresses. -
電子資源:	https://doi.org/10.1007/978-3-030-90459-3
ISBN:	9783030904593

Theory of cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.. Part I /
Theory of cryptography19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.Part I /[electronic resource] :TCC 2021edited by Kobbi Nissim, Brent Waters. - Cham :Springer International Publishing :2021. - xvi, 785 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,130420302-9743 ;. - Lecture notes in computer science ;13042..

Secure Quantum Computation with Classical Communication -- Secure Software Leasing from Standard Assumptions -- Post-quantum Resettably-Sound Zero Knowledge -- Secure Software Leasing Without Assumptions -- The Round Complexity of Quantum Zero-Knowledge -- Rate-1 Quantum Fully Homomorphic Encryption -- Unifying Presampling via Concentration Bounds -- Quantum Key-length Extension -- Relationships between quantum IND-CPA notions -- Classical Binding for Quantum Commitments -- Unclonable Encryption, Revisited -- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs -- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness -- Tight Security Bounds for Micali's SNARGs -- Acyclicity Programming for Sigma-Protocols -- Statistical ZAPs from Group-Based Assumptions -- Generalized Proofs of Knowledge with Fully Dynamic Setup -- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions -- On expected polynomial runtime in cryptography -- Information-Theoretically Secure MPC against Mixed Dynamic Adversaries -- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback -- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation -- Adaptive Security of Multi-Party Protocols, Revisited -- On Actively-Secure Elementary MPC Reductions -- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.

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: 9783030904593

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

844473
Data encryption (Computer science)
--Congresses.

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

Dewey Class. No.: 005.824

Theory of cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021 : proceedings.. Part I /
LDR:03187nmm 22003735a 4500 001 2258745
003 DE-He213
005 20211105215532.0
006 m d
007 cr nn 008maaau
008 220422s2021 sz s 0 eng d
020 $a 9783030904593 $q (electronic bk.)
020 $a 9783030904586 $q (paper)
024 7 $a 10.1007/978-3-030-90459-3 $2 doi
035 $a 978-3-030-90459-3
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 $a Theory of Cryptography Conference $n (19th : $d 2021 : $c Raleigh, N.C.) $3 3531476
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 I / $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 xvi, 785 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13042
490 1 $a Security and cryptology
505 0 $a Secure Quantum Computation with Classical Communication -- Secure Software Leasing from Standard Assumptions -- Post-quantum Resettably-Sound Zero Knowledge -- Secure Software Leasing Without Assumptions -- The Round Complexity of Quantum Zero-Knowledge -- Rate-1 Quantum Fully Homomorphic Encryption -- Unifying Presampling via Concentration Bounds -- Quantum Key-length Extension -- Relationships between quantum IND-CPA notions -- Classical Binding for Quantum Commitments -- Unclonable Encryption, Revisited -- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs -- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial Hardness -- Tight Security Bounds for Micali's SNARGs -- Acyclicity Programming for Sigma-Protocols -- Statistical ZAPs from Group-Based Assumptions -- Generalized Proofs of Knowledge with Fully Dynamic Setup -- Fully-succinct Publicly Verifiable Delegation from Constant-Size Assumptions -- On expected polynomial runtime in cryptography -- Information-Theoretically Secure MPC against Mixed Dynamic Adversaries -- Round-Efficient Byzantine Agreement and Multi-Party Computation with Asynchronous Fallback -- Two-Round Maliciously Secure Computation with Super-Polynomial Simulation -- Adaptive Security of Multi-Party Protocols, Revisited -- On Actively-Secure Elementary MPC Reductions -- Environmentally Friendly Composable Multi-Party Computation in the Plain Model from Standard (Timed) Assumptions.
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) $v Congresses. $3 844473
650 0 $a Computer networks $x Security measures $x Congresses. $3 582085
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Coding and Information Theory. $3 891252
650 2 4 $a Information Systems and Communication Service. $3 891044
650 2 4 $a Computer Communication Networks. $3 775497
650 2 4 $a Systems and Data Security. $3 898223
700 1 $a Nissim, Kobbi. $3 3531477
700 1 $a Waters, Brent R. $3 1932787
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13042. $3 3531485
830 0 $a Security and cryptology. $3 3382517
856 4 0 $u https://doi.org/10.1007/978-3-030-90459-3
950 $a Computer Science (SpringerNature-11645)