國立虎尾科技大學 |

Topics in Cryptology – CT-RSA 2020 = The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Topics in Cryptology – CT-RSA 2020/ edited by Stanislaw Jarecki.
其他題名:	The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings /
其他作者:	Jarecki, Stanislaw.
面頁冊數:	XIII, 694 p. 350 illus., 28 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Software Engineering. -
電子資源:	https://doi.org/10.1007/978-3-030-40186-3
ISBN:	9783030401863

Topics in Cryptology – CT-RSA 2020 = The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings /
Topics in Cryptology – CT-RSA 2020The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings /[electronic resource] :edited by Stanislaw Jarecki. - 1st ed. 2020. - XIII, 694 p. 350 illus., 28 illus. in color.online resource. - Security and Cryptology ;12006. - Security and Cryptology ;9241.

Generic Attack on Iterated Tweakable FX Constructions -- Universal Forgery Attack against GCM-RUP -- My Gadget Just Cares For Me - How NINA Can Prove Security Against Combined Attacks -- Modeling Memory Faults in Signature and Authenticated Encryption Schemes -- Cryptanalysis of the Multivariate Encryption Scheme EFLASH -- FPL: White-Box Secure Block Cipher Using Parallel Table Look-Ups -- Extending NIST's CAVP Testing of Cryptographic Hash Function Implementations -- A Fast Characterization Method for Semi-invasive Fault Injection Attacks -- Tightly Secure Two-Pass Authenticated Key Exchange Protocol in the CK Model -- Symmetric-key Authenticated Key Exchange (SAKE) with Perfect Forward Secrecy -- TMPS: Ticket-Mediated Password Strengthening -- Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption -- Consensus from Signatures of Work -- Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits -- Better Bootstrapping for Approximate Homomorphic Encryption -- Improved Secure Integer Comparison via Homomorphic Encryption -- Efficient FPGA Implementations of LowMC and Picnic -- Traceable Ring Signatures with Post-quantum Security -- Post-Quantum Provably-Secure Authentication and MAC from Mersenne Primes -- Another look at some isogeny hardness assumptions -- How to Construct CSIDH on Edwards Curves -- Policy-Based Sanitizable Signatures -- Traceable Inner Product Functional Encryption -- One-More Assumptions Do Not Help Fiat-Shamir-type Signature Schemes in NPROM -- Cut-and-Choose for Garbled RAM -- Universally Composable Accumulators -- A Non-Interactive Shu e Argument With Low Trust Assumptions. .

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2020, CT-RSA 2020, held in San Francisco, CA, USA, in February 2020. The 28 papers presented in this volume were carefully reviewed and selected from 95 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: 9783030401863

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

669632
Software Engineering.

LC Class. No.: QA76.9.D335

Dewey Class. No.: 005.82

Topics in Cryptology – CT-RSA 2020 = The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings /
LDR:03680nam a22004215i 4500 001 1023906
003 DE-He213
005 20200704184048.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030401863 $9 978-3-030-40186-3
024 7 $a 10.1007/978-3-030-40186-3 $2 doi
035 $a 978-3-030-40186-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 Topics in Cryptology – CT-RSA 2020 $h [electronic resource] : $b The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings / $c edited by Stanislaw Jarecki.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XIII, 694 p. 350 illus., 28 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 12006
505 0 $a Generic Attack on Iterated Tweakable FX Constructions -- Universal Forgery Attack against GCM-RUP -- My Gadget Just Cares For Me - How NINA Can Prove Security Against Combined Attacks -- Modeling Memory Faults in Signature and Authenticated Encryption Schemes -- Cryptanalysis of the Multivariate Encryption Scheme EFLASH -- FPL: White-Box Secure Block Cipher Using Parallel Table Look-Ups -- Extending NIST's CAVP Testing of Cryptographic Hash Function Implementations -- A Fast Characterization Method for Semi-invasive Fault Injection Attacks -- Tightly Secure Two-Pass Authenticated Key Exchange Protocol in the CK Model -- Symmetric-key Authenticated Key Exchange (SAKE) with Perfect Forward Secrecy -- TMPS: Ticket-Mediated Password Strengthening -- Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption -- Consensus from Signatures of Work -- Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits -- Better Bootstrapping for Approximate Homomorphic Encryption -- Improved Secure Integer Comparison via Homomorphic Encryption -- Efficient FPGA Implementations of LowMC and Picnic -- Traceable Ring Signatures with Post-quantum Security -- Post-Quantum Provably-Secure Authentication and MAC from Mersenne Primes -- Another look at some isogeny hardness assumptions -- How to Construct CSIDH on Edwards Curves -- Policy-Based Sanitizable Signatures -- Traceable Inner Product Functional Encryption -- One-More Assumptions Do Not Help Fiat-Shamir-type Signature Schemes in NPROM -- Cut-and-Choose for Garbled RAM -- Universally Composable Accumulators -- A Non-Interactive Shu e Argument With Low Trust Assumptions. .
520 $a This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2020, CT-RSA 2020, held in San Francisco, CA, USA, in February 2020. The 28 papers presented in this volume were carefully reviewed and selected from 95 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 2 4 $a Software Engineering. $3 669632
650 2 4 $a Coding and Information Theory. $3 669784
650 2 4 $a Computing Milieux. $3 669921
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Computer Communication Networks. $3 669310
650 1 4 $a Cryptology. $3 1211076
650 0 $a Software engineering. $3 562952
650 0 $a Information theory. $3 595305
650 0 $a Coding theory. $3 561460
650 0 $a Computers. $3 565115
650 0 $a Application software. $3 528147
650 0 $a Computer communication systems. $3 1115394
650 0 $a Data encryption (Computer science). $3 1051084
700 1 $a Jarecki, Stanislaw. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 897540
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030401856
776 0 8 $i Printed edition: $z 9783030401870
830 0 $a Security and Cryptology ; $v 9241 $3 1254069
856 4 0 $u https://doi.org/10.1007/978-3-030-40186-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)