Topics in cryptology - CT-RSA 2020 =...
Cryptographers' Track at RSA Conference ((2020 :)

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 /
  • 紀錄類型: 書目-電子資源 : 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 /
    其他題名: CT-RSA 2020
    其他作者: Jarecki, Stanislaw.
    團體作者: Cryptographers' Track at RSA Conference
    出版者: Cham :Springer International Publishing : : 2020.,
    面頁冊數: xiii, 694 p. :ill., digital ;24 cm.
    內容註: 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
    標題: Data encryption (Computer science) - Congresses. -
    電子資源: https://doi.org/10.1007/978-3-030-40186-3
    ISBN: 9783030401863
館藏地:  出版年:  卷號: 
館藏
  • 1 筆 • 頁數 1 •
 
W9413606 電子資源 11.線上閱覽_V 電子書 EB QA76.9.A25 C79 2020 一般使用(Normal) 在架 0
  • 1 筆 • 頁數 1 •
多媒體
評論
Export
取書館
 
 
變更密碼
登入