國立虎尾科技大學 |

Advances in Cryptology – ASIACRYPT 2021 = 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Advances in Cryptology – ASIACRYPT 2021/ edited by Mehdi Tibouchi, Huaxiong Wang.
其他題名:	27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III /
其他作者:	Wang, Huaxiong.
面頁冊數:	XVII, 702 p. 110 illus., 18 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mobile and Network Security. -
電子資源:	https://doi.org/10.1007/978-3-030-92078-4
ISBN:	9783030920784

Advances in Cryptology – ASIACRYPT 2021 = 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III /
Advances in Cryptology – ASIACRYPT 202127th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III /[electronic resource] :edited by Mehdi Tibouchi, Huaxiong Wang. - 1st ed. 2021. - XVII, 702 p. 110 illus., 18 illus. in color.online resource. - Security and Cryptology ;13092. - Security and Cryptology ;9241.

Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions -- Gentry-Wichs Is Tight: A Falsifiable Non-Adaptively Sound SNARG -- Proofs for Inner Pairing Products and Applications -- Snarky Ceremonies -- Efficient NIZKs for Algebraic Sets -- Bit Security as Computational Cost for Winning Games with High Probability -- Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework) -- How to Build a Trapdoor Function from an Encryption Scheme -- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions -- Batching Base Oblivious Transfers -- Algebraic Adversaries in the Universal Composability Framework -- Luby-Rackoff Backwards with More Users and More Security -- Double-Block-Length Hash Function for Minimum Memory Size -- Toward a Fully Secure Authenticated Encryption Scheme From a Pseudorandom Permutation -- Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys -- FAST: Secure and High Performance Format-Preserving Encryption and Tokenization -- Fine-tuning the ISO/IEC Standard LightMAC -- Categorization of Faulty Nonce Misuse Resistant Message Authentication -- Balanced Non-Adjacent Forms -- Efficient Boolean Search over Encrypted Data with Reduced Leakage -- Revisiting Homomorphic Encryption Schemes for Finite Fields -- Transciphering Framework for Approximate Homomorphic Encryption -- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE.

The four-volume proceedings LNCS 13090, 13091, 13092, and 13093 constitutes the proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2021, which was held during December 6-10, 2021. The conference was planned to take place in Singapore, but changed to an online format due to the COVID-19 pandemic. The total of 95 full papers presented in these proceedings was carefully reviewed and selected from 341 submissions. The papers were organized in topical sections as follows: Part I: Best paper awards; public-key cryptanalysis; symmetric key cryptanalysis; quantum security; Part II: physical attacks, leakage and countermeasures; multiparty computation; enhanced public-key encryption and time-lock puzzles; real-world protocols; Part III: NIZK and SNARKs; theory; symmetric-key constructions; homomorphic encryption and encrypted search; Part IV: Lattice cryptanalysis; post-quantum cryptography; advanced encryption and signatures; zero-knowledge proofs, threshold and multi-signatures; authenticated key exchange.

ISBN: 9783030920784

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

1211619
Mobile and Network Security.

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Advances in Cryptology – ASIACRYPT 2021 = 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III /
LDR:04188nam a22004215i 4500 001 1057453
003 DE-He213
005 20211130155106.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030920784 $9 978-3-030-92078-4
024 7 $a 10.1007/978-3-030-92078-4 $2 doi
035 $a 978-3-030-92078-4
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 Advances in Cryptology – ASIACRYPT 2021 $h [electronic resource] : $b 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part III / $c edited by Mehdi Tibouchi, Huaxiong Wang.
250 $a 1st ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XVII, 702 p. 110 illus., 18 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 13092
505 0 $a Lunar: a Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions -- Gentry-Wichs Is Tight: A Falsifiable Non-Adaptively Sound SNARG -- Proofs for Inner Pairing Products and Applications -- Snarky Ceremonies -- Efficient NIZKs for Algebraic Sets -- Bit Security as Computational Cost for Winning Games with High Probability -- Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework) -- How to Build a Trapdoor Function from an Encryption Scheme -- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom Functions -- Batching Base Oblivious Transfers -- Algebraic Adversaries in the Universal Composability Framework -- Luby-Rackoff Backwards with More Users and More Security -- Double-Block-Length Hash Function for Minimum Memory Size -- Toward a Fully Secure Authenticated Encryption Scheme From a Pseudorandom Permutation -- Tight Security for Key-Alternating Ciphers with Correlated Sub-Keys -- FAST: Secure and High Performance Format-Preserving Encryption and Tokenization -- Fine-tuning the ISO/IEC Standard LightMAC -- Categorization of Faulty Nonce Misuse Resistant Message Authentication -- Balanced Non-Adjacent Forms -- Efficient Boolean Search over Encrypted Data with Reduced Leakage -- Revisiting Homomorphic Encryption Schemes for Finite Fields -- Transciphering Framework for Approximate Homomorphic Encryption -- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHE.
520 $a The four-volume proceedings LNCS 13090, 13091, 13092, and 13093 constitutes the proceedings of the 27th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2021, which was held during December 6-10, 2021. The conference was planned to take place in Singapore, but changed to an online format due to the COVID-19 pandemic. The total of 95 full papers presented in these proceedings was carefully reviewed and selected from 341 submissions. The papers were organized in topical sections as follows: Part I: Best paper awards; public-key cryptanalysis; symmetric key cryptanalysis; quantum security; Part II: physical attacks, leakage and countermeasures; multiparty computation; enhanced public-key encryption and time-lock puzzles; real-world protocols; Part III: NIZK and SNARKs; theory; symmetric-key constructions; homomorphic encryption and encrypted search; Part IV: Lattice cryptanalysis; post-quantum cryptography; advanced encryption and signatures; zero-knowledge proofs, threshold and multi-signatures; authenticated key exchange.
650 2 4 $a Mobile and Network Security. $3 1211619
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 1 4 $a Cryptology. $3 1211076
650 0 $a Computer networks $x Security measures. $3 555385
650 0 $a Computer communication systems. $3 1115394
650 0 $a Application software. $3 528147
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Data encryption (Computer science). $3 1051084
700 1 $a Wang, Huaxiong. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 894686
700 1 $a Tibouchi, Mehdi. $e editor. $1 https://orcid.org/0000-0002-2736-2963 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1362921
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030920777
776 0 8 $i Printed edition: $z 9783030920791
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-92078-4
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)