國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Advances in cryptology - ASIACRYPT 2...

(1998 :)

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 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Advances in cryptology - ASIACRYPT 2021edited by Mehdi Tibouchi, Huaxiong Wang.
其他題名:	27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6-10, 2021 : proceedings.
其他題名:	ASIACRYPT 2021
其他作者:	Tibouchi, Mehdi.
團體作者:
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	xvii, 702 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science)
電子資源:	https://doi.org/10.1007/978-3-030-92078-4
ISBN:	9783030920784$q(electronic bk.)

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 /
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] :ASIACRYPT 2021edited by Mehdi Tibouchi, Huaxiong Wang. - Cham :Springer International Publishing :2021. - xvii, 702 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,130920302-9743 ;. - Lecture notes in computer science ;4891..

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$q(electronic bk.)

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

184520
Data encryption (Computer science)

LC Class. No.: QA76.9.D335 / I583 2021

Dewey Class. No.: 005.824

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 /
LDR:03947nmm 22003735a 4500 001 613911
003 DE-He213
005 20211130155106.0
006 m d
007 cr nn 008maaau
008 220627s2021 sz s 0 eng d
020 $a 9783030920784$q(electronic bk.)
020 $a 9783030920777$q(paper)
024 7 $a 10.1007/978-3-030-92078-4 $2 doi
035 $a 978-3-030-92078-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.D335 $b I583 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.D335 $b I61 2021
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
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. $n Part III / $c edited by Mehdi Tibouchi, Huaxiong Wang.
246 3 $a ASIACRYPT 2021
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xvii, 702 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13092
490 1 $a Security and cryptology
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 0 $a Data encryption (Computer science) $3 184520
650 0 $a Computer security $v Congresses. $3 383239
650 1 4 $a Cryptology. $3 825728
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Information Systems Applications (incl. Internet) $3 530743
650 2 4 $a Computer Communication Networks. $3 218087
650 2 4 $a Mobile and Network Security. $3 825732
700 1 $a Tibouchi, Mehdi. $3 911966
700 1 $a Wang, Huaxiong. $3 346734
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Security and cryptology. $3 822028
856 4 0 $u https://doi.org/10.1007/978-3-030-92078-4
950 $a Computer Science (SpringerNature-11645)