東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Topics in cryptology - CT-RSA 2020 =...

Cryptographers' Track at RSA Conference ((2020 :)

Linked to FindBook

Google Book

Amazon

博客來

Topics in cryptology - CT-RSA 2020 = the Cryptographers' Track at the RSA Conference 2020, San Francisco, CA, USA, February 24-28, 2020 : proceedings /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Topics in cryptology - CT-RSA 2020/ edited by Stanislaw Jarecki.
Reminder of title:	the Cryptographers' Track at the RSA Conference 2020, San Francisco, CA, USA, February 24-28, 2020 : proceedings /
remainder title:	CT-RSA 2020
other author:	Jarecki, Stanislaw.
corporate name:	Cryptographers' Track at RSA Conference
Published:	Cham :Springer International Publishing : : 2020.,
Description:	xiii, 694 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Data encryption (Computer science) - Congresses. -
Online resource:	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] :CT-RSA 2020edited by Stanislaw Jarecki. - Cham :Springer International Publishing :2020. - xiii, 694 p. :ill., digital ;24 cm. - Lecture notes in computer science,120060302-9743 ;. - Lecture notes in computer science ;12006..

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:

844473
Data encryption (Computer science)
--Congresses.

LC Class. No.: QA76.9.A25 / C79 2020

Dewey Class. No.: 005.824

Topics in cryptology - CT-RSA 2020 = the Cryptographers' Track at the RSA Conference 2020, San Francisco, CA, USA, February 24-28, 2020 : proceedings /
LDR:03417nmm a2200373 a 4500 001 2257978
003 DE-He213
005 20200704184048.0
006 m d
007 cr nn 008maaau
008 220420s2020 sz s 0 eng d
020 $a 9783030401863 $q (electronic bk.)
020 $a 9783030401856 $q (paper)
024 7 $a 10.1007/978-3-030-40186-3 $2 doi
035 $a 978-3-030-40186-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25 $b C79 2020
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.A25 $b C957 2020
111 2 $a Cryptographers' Track at RSA Conference $d (2020 : $c San Francisco, Calif.) $3 3529655
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.
246 3 $a CT-RSA 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xiii, 694 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12006
490 1 $a Security and cryptology
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 0 $a Data encryption (Computer science) $v Congresses. $3 844473
650 1 4 $a Cryptology. $3 3382308
650 2 4 $a Computer Communication Networks. $3 775497
650 2 4 $a Information Systems Applications (incl. Internet) $3 1565452
650 2 4 $a Computing Milieux. $3 893243
650 2 4 $a Coding and Information Theory. $3 891252
650 2 4 $a Software Engineering. $3 890874
700 1 $a Jarecki, Stanislaw. $3 1002974
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 12006. $3 3529656
830 0 $a Security and cryptology. $3 3382517
856 4 0 $u https://doi.org/10.1007/978-3-030-40186-3
950 $a Computer Science (SpringerNature-11645)