語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Theory of Cryptography = 19th Intern...
~
Waters, Brent.
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, Part I /
其他作者:
Waters, Brent.
面頁冊數:
XVI, 785 p. 89 illus., 13 illus. in color.online resource. :
Contained By:
Springer Nature eBook
標題:
Systems and Data Security. -
電子資源:
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 Cryptography
19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part I /[electronic resource] :edited by Kobbi Nissim, Brent Waters. - 1st ed. 2021. - XVI, 785 p. 89 illus., 13 illus. in color.online resource. - Security and Cryptology ;13042. - Security and Cryptology ;9241.
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:
677062
Systems and Data Security.
LC Class. No.: QA76.9.D335
Dewey Class. No.: 005.82
Theory of Cryptography = 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part I /
LDR
:03431nam a22004215i 4500
001
1056972
003
DE-He213
005
20211105215532.0
007
cr nn 008mamaa
008
220103s2021 sz | s |||| 0|eng d
020
$a
9783030904593
$9
978-3-030-90459-3
024
7
$a
10.1007/978-3-030-90459-3
$2
doi
035
$a
978-3-030-90459-3
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
19th International Conference, TCC 2021, Raleigh, NC, USA, November 8–11, 2021, Proceedings, Part I /
$c
edited by Kobbi Nissim, Brent Waters.
250
$a
1st ed. 2021.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
XVI, 785 p. 89 illus., 13 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
13042
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
2 4
$a
Systems and Data Security.
$3
677062
650
2 4
$a
Computer Communication Networks.
$3
669310
650
2 4
$a
Information Systems and Communication Service.
$3
669203
650
2 4
$a
Coding and Information Theory.
$3
669784
650
1 4
$a
Cryptology.
$3
1211076
650
0
$a
Computer security.
$3
557122
650
0
$a
Computer communication systems.
$3
1115394
650
0
$a
Computers.
$3
565115
650
0
$a
Information theory.
$3
595305
650
0
$a
Coding theory.
$3
561460
650
0
$a
Data encryption (Computer science).
$3
1051084
700
1
$a
Waters, Brent.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
793765
700
1
$a
Nissim, Kobbi.
$e
editor.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1362343
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030904586
776
0 8
$i
Printed edition:
$z
9783030904609
830
0
$a
Security and Cryptology ;
$v
9241
$3
1254069
856
4 0
$u
https://doi.org/10.1007/978-3-030-90459-3
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)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入