語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Cryptology and Network Security = 20...
~
Conti, Mauro.
Cryptology and Network Security = 20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Cryptology and Network Security/ edited by Mauro Conti, Marc Stevens, Stephan Krenn.
其他題名:
20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings /
其他作者:
Krenn, Stephan.
面頁冊數:
XIII, 554 p. 56 illus.online resource. :
Contained By:
Springer Nature eBook
標題:
Coding and Information Theory. -
電子資源:
https://doi.org/10.1007/978-3-030-92548-2
ISBN:
9783030925482
Cryptology and Network Security = 20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings /
Cryptology and Network Security
20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings /[electronic resource] :edited by Mauro Conti, Marc Stevens, Stephan Krenn. - 1st ed. 2021. - XIII, 554 p. 56 illus.online resource. - Security and Cryptology ;13099. - Security and Cryptology ;9241.
Encryption -- Cross-Domain Attribute-Based Access Control Encryption -- Grain-128AEADv2: Strengthening the Initialization Against Key Reconstruction -- Partition Oracles from Weak Key Forgeries -- Practical Privacy-Preserving Face Identification based on FunctionHiding Functional Encryption -- The Matrix Reloaded: Multiplication Strategies in FrodoKEM -- Signatures -- BlindOR: An Effcient Lattice-Based Blind Signature Scheme from OR-Proofs -- Effcient Threshold-Optimal ECDSA -- GMMT: A Revocable Group Merkle Multi-Tree Signature Scheme -- Issuer-Hiding Attribute-Based Credentials -- Report and Trace Ring Signatures -- Selectively Linkable Group Signatures — Stronger Security and Preserved Verifiability -- Cryptographic Schemes and Protocols -- FO-like Combiners and Hybrid Post-Quantum Cryptography -- Linear-time oblivious permutations for SPDZ -- On the Higher-bit Version of Approximate Inhomogeneous Short Integer Solution Problem -- Practical Continuously Non-Malleable Randomness Encoders in the Random Oracle Model -- Attacks and Counter-Measures -- Countermeasures against Backdoor Attacks towards Malware Detectors -- Free By Design: On the Feasibility Of Free-Riding Attacks Against Zero-Rated Services -- Function-private Conditional Disclosure of Secrets and Multi-evaluation Threshold Distributed Point Functions -- How Distance-bounding can Detect Internet Traffc Hijacking -- SoK: Secure Memory Allocation -- Toward Learning Robust Detectors from Imbalanced Datasets Leveraging Weighted Adversarial Training -- Towards Quantum Large-Scale Password Guessing on Real-World Distributions -- Attestation and Verification -- Anonymous Transactions with Revocation and Auditing in Hyperledger Fabric -- Attestation Waves: Platform Trust via Remote Power Analysis -- How (not) to Achieve both Coercion Resistance and Cast as Intended Verifiability in Remote eVoting -- Subversion-Resistant Quasi-Adaptive NIZK and Applications to Modular zk-SNARKs -- THC: Practical and Cost-Effective Verification of Delegated Computation -- Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model.
This book constitutes the refereed proceedings of the 20th International Conference on Cryptology and Network Security, CANS 2021, which was held during December 13-15, 2021. The conference was originally planned to take place in Vienna, Austria, and changed to an online event due to the COVID-19 pandemic. The 25 full and 3 short papers presented in these proceedings were carefully reviewed and selected from 85 submissions. They were organized in topical sections as follows: Encryption; signatures; cryptographic schemes and protocols; attacks and counter-measures; and attestation and verification.
ISBN: 9783030925482
Standard No.: 10.1007/978-3-030-92548-2doiSubjects--Topical Terms:
669784
Coding and Information Theory.
LC Class. No.: QA76.9.D335
Dewey Class. No.: 005.82
Cryptology and Network Security = 20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings /
LDR
:04211nam a22004215i 4500
001
1057676
003
DE-He213
005
20211208085657.0
007
cr nn 008mamaa
008
220103s2021 sz | s |||| 0|eng d
020
$a
9783030925482
$9
978-3-030-92548-2
024
7
$a
10.1007/978-3-030-92548-2
$2
doi
035
$a
978-3-030-92548-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
Cryptology and Network Security
$h
[electronic resource] :
$b
20th International Conference, CANS 2021, Vienna, Austria, December 13-15, 2021, Proceedings /
$c
edited by Mauro Conti, Marc Stevens, Stephan Krenn.
250
$a
1st ed. 2021.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
XIII, 554 p. 56 illus.
$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
13099
505
0
$a
Encryption -- Cross-Domain Attribute-Based Access Control Encryption -- Grain-128AEADv2: Strengthening the Initialization Against Key Reconstruction -- Partition Oracles from Weak Key Forgeries -- Practical Privacy-Preserving Face Identification based on FunctionHiding Functional Encryption -- The Matrix Reloaded: Multiplication Strategies in FrodoKEM -- Signatures -- BlindOR: An Effcient Lattice-Based Blind Signature Scheme from OR-Proofs -- Effcient Threshold-Optimal ECDSA -- GMMT: A Revocable Group Merkle Multi-Tree Signature Scheme -- Issuer-Hiding Attribute-Based Credentials -- Report and Trace Ring Signatures -- Selectively Linkable Group Signatures — Stronger Security and Preserved Verifiability -- Cryptographic Schemes and Protocols -- FO-like Combiners and Hybrid Post-Quantum Cryptography -- Linear-time oblivious permutations for SPDZ -- On the Higher-bit Version of Approximate Inhomogeneous Short Integer Solution Problem -- Practical Continuously Non-Malleable Randomness Encoders in the Random Oracle Model -- Attacks and Counter-Measures -- Countermeasures against Backdoor Attacks towards Malware Detectors -- Free By Design: On the Feasibility Of Free-Riding Attacks Against Zero-Rated Services -- Function-private Conditional Disclosure of Secrets and Multi-evaluation Threshold Distributed Point Functions -- How Distance-bounding can Detect Internet Traffc Hijacking -- SoK: Secure Memory Allocation -- Toward Learning Robust Detectors from Imbalanced Datasets Leveraging Weighted Adversarial Training -- Towards Quantum Large-Scale Password Guessing on Real-World Distributions -- Attestation and Verification -- Anonymous Transactions with Revocation and Auditing in Hyperledger Fabric -- Attestation Waves: Platform Trust via Remote Power Analysis -- How (not) to Achieve both Coercion Resistance and Cast as Intended Verifiability in Remote eVoting -- Subversion-Resistant Quasi-Adaptive NIZK and Applications to Modular zk-SNARKs -- THC: Practical and Cost-Effective Verification of Delegated Computation -- Tiramisu: Black-Box Simulation Extractable NIZKs in the Updatable CRS Model.
520
$a
This book constitutes the refereed proceedings of the 20th International Conference on Cryptology and Network Security, CANS 2021, which was held during December 13-15, 2021. The conference was originally planned to take place in Vienna, Austria, and changed to an online event due to the COVID-19 pandemic. The 25 full and 3 short papers presented in these proceedings were carefully reviewed and selected from 85 submissions. They were organized in topical sections as follows: Encryption; signatures; cryptographic schemes and protocols; attacks and counter-measures; and attestation and verification.
650
2 4
$a
Coding and Information Theory.
$3
669784
650
2 4
$a
Image Processing and Computer Vision.
$3
670819
650
2 4
$a
Computer Communication Networks.
$3
669310
650
2 4
$a
Software Engineering/Programming and Operating Systems.
$3
669780
650
2 4
$a
Information Systems Applications (incl. Internet).
$3
881699
650
1 4
$a
Cryptology.
$3
1211076
650
0
$a
Information theory.
$3
595305
650
0
$a
Coding theory.
$3
561460
650
0
$a
Optical data processing.
$3
639187
650
0
$a
Computer communication systems.
$3
1115394
650
0
$a
Software engineering.
$3
562952
650
0
$a
Application software.
$3
528147
650
0
$a
Data encryption (Computer science).
$3
1051084
700
1
$a
Krenn, Stephan.
$e
editor.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1309865
700
1
$a
Stevens, Marc.
$e
editor.
$1
https://orcid.org/0000-0002-7091-2924
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1363173
700
1
$a
Conti, Mauro.
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1067786
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030925475
776
0 8
$i
Printed edition:
$z
9783030925499
830
0
$a
Security and Cryptology ;
$v
9241
$3
1254069
856
4 0
$u
https://doi.org/10.1007/978-3-030-92548-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)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入