國立虎尾科技大學 |

Topics in Cryptology – CT-RSA 2019 = The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Topics in Cryptology – CT-RSA 2019/ edited by Mitsuru Matsui.
其他題名:	The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings /
其他作者:	Matsui, Mitsuru.
面頁冊數:	XI, 578 p. 584 illus., 19 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Data encryption (Computer science). -
電子資源:	https://doi.org/10.1007/978-3-030-12612-4
ISBN:	9783030126124

Topics in Cryptology – CT-RSA 2019 = The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings /
Topics in Cryptology – CT-RSA 2019The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings /[electronic resource] :edited by Mitsuru Matsui. - 1st ed. 2019. - XI, 578 p. 584 illus., 19 illus. in color.online resource. - Security and Cryptology ;11405. - Security and Cryptology ;9241.

Structure-Preserving Certificateless Encryption and its Application -- Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks -- Downgradable Identity-based Encryption and Applications -- Large Universe Subset Predicate Encryption Based on Static Assumption (without Random Oracle) -- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme -- New techniques for multi-value input homomorphic evaluation and applications -- Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality -- Robust Encryption, Extended -- Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model -- Doubly half-injective PRGs for incompressible white-box cryptography -- Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-Party Computation -- Lossy Trapdoor Permutations with Improved Lossiness -- Post-Quantum EPID Signatures from Symmetric Primitives -- Assessment of the key reuse resilience of NewHope -- Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions -- Linking Stam’s Bounds With Generalized Truncation -- Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling -- Efficient Fully-Leakage Resilient One-More Signature Schemes -- MILP-based Differential Attack on Round-reduced GIFT -- Quantum Chosen-Ciphertext Attacks against Feistel Ciphers -- Automatic Search for A Variant of Division Property Using Three Subsets -- Constructing TI-friendly Substitution Boxes using Shift-Invariant Permutations -- Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks -- EPIC: Efficient Private Image Classification (or: Learning from the Masters) -- Context Hiding Multi-Key Linearly Homomorphic Authenticators -- Revisiting the Secret Hiding Assumption Used in Verifiable (Outsourced) Computation -- Delegatable Anonymous Credentials from Mercurial Signatures -- Accountable Tracing Signatures from Lattices.

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2019, CT-RSA 2019, held in San Francisco, CA, USA, in March 2019. The 28 papers presented in this volume were carefully reviewed and selected from 75 submissions. CT-RSA is the track devoted to scientific papers on cryptography, public-key to symmetric-key cryptography and from crypto- graphic protocols to primitives and their implementation security.

ISBN: 9783030126124

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

1051084
Data encryption (Computer science).

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Topics in Cryptology – CT-RSA 2019 = The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings /
LDR:03950nam a22004215i 4500 001 1010360
003 DE-He213
005 20200704174824.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030126124 $9 978-3-030-12612-4
024 7 $a 10.1007/978-3-030-12612-4 $2 doi
035 $a 978-3-030-12612-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 Topics in Cryptology – CT-RSA 2019 $h [electronic resource] : $b The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings / $c edited by Mitsuru Matsui.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XI, 578 p. 584 illus., 19 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 11405
505 0 $a Structure-Preserving Certificateless Encryption and its Application -- Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks -- Downgradable Identity-based Encryption and Applications -- Large Universe Subset Predicate Encryption Based on Static Assumption (without Random Oracle) -- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme -- New techniques for multi-value input homomorphic evaluation and applications -- Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality -- Robust Encryption, Extended -- Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model -- Doubly half-injective PRGs for incompressible white-box cryptography -- Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-Party Computation -- Lossy Trapdoor Permutations with Improved Lossiness -- Post-Quantum EPID Signatures from Symmetric Primitives -- Assessment of the key reuse resilience of NewHope -- Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions -- Linking Stam’s Bounds With Generalized Truncation -- Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling -- Efficient Fully-Leakage Resilient One-More Signature Schemes -- MILP-based Differential Attack on Round-reduced GIFT -- Quantum Chosen-Ciphertext Attacks against Feistel Ciphers -- Automatic Search for A Variant of Division Property Using Three Subsets -- Constructing TI-friendly Substitution Boxes using Shift-Invariant Permutations -- Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks -- EPIC: Efficient Private Image Classification (or: Learning from the Masters) -- Context Hiding Multi-Key Linearly Homomorphic Authenticators -- Revisiting the Secret Hiding Assumption Used in Verifiable (Outsourced) Computation -- Delegatable Anonymous Credentials from Mercurial Signatures -- Accountable Tracing Signatures from Lattices.
520 $a This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2019, CT-RSA 2019, held in San Francisco, CA, USA, in March 2019. The 28 papers presented in this volume were carefully reviewed and selected from 75 submissions. CT-RSA is the track devoted to scientific papers on cryptography, public-key to symmetric-key cryptography and from crypto- graphic protocols to primitives and their implementation security.
650 0 $a Data encryption (Computer science). $3 1051084
650 0 $a Computer communication systems. $3 1115394
650 0 $a Coding theory. $3 561460
650 0 $a Information theory. $3 595305
650 0 $a Computers and civilization. $3 556557
650 0 $a Software engineering. $3 562952
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Computers and Society. $3 669900
650 2 4 $a Software Engineering. $3 669632
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Matsui, Mitsuru. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 792505
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030126117
776 0 8 $i Printed edition: $z 9783030126131
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-12612-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)