default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCT-RSA 2020: San Francisco, CA, USA
- Stanislaw Jarecki:
Topics in Cryptology - CT-RSA 2020 - The Cryptographers' Track at the RSA Conference 2020, San Francisco, CA, USA, February 24-28, 2020, Proceedings. Lecture Notes in Computer Science 12006, Springer 2020, ISBN 978-3-030-40185-6 - Ferdinand Sibleyras:
Generic Attack on Iterated Tweakable FX Constructions. 1-14 - Yanbin Li, Gaëtan Leurent, Meiqin Wang, Wei Wang, Guoyan Zhang, Yu Liu:
Universal Forgery Attack Against GCM-RUP. 15-34 - Siemen Dhooghe
, Svetla Nikova:
My Gadget Just Cares for Me - How NINA Can Prove Security Against Combined Attacks. 35-55 - Marc Fischlin, Felix Günther:
Modeling Memory Faults in Signature and Authenticated Encryption Schemes. 56-84 - Morten Øygarden, Patrick Felke, Håvard Raddum, Carlos Cid:
Cryptanalysis of the Multivariate Encryption Scheme EFLASH. 85-105 - Jihoon Kwon, ByeongHak Lee, Jooyoung Lee, Dukjae Moon:
FPL: White-Box Secure Block Cipher Using Parallel Table Look-Ups. 106-128 - Nicky Mouha, Christopher Celi:
Extending NIST's CAVP Testing of Cryptographic Hash Function Implementations. 129-145 - Lichao Wu, Gerard Ribera, Noemie Beringuier-Boher, Stjepan Picek:
A Fast Characterization Method for Semi-invasive Fault Injection Attacks. 146-170 - Yuting Xiao, Rui Zhang, Hui Ma:
Tightly Secure Two-Pass Authenticated Key Exchange Protocol in the CK Model. 171-198 - Gildas Avoine, Sébastien Canard, Loïc Ferreira:
Symmetric-Key Authenticated Key Exchange (SAKE) with Perfect Forward Secrecy. 199-224 - John Kelsey, Dana Dachman-Soled, Sweta Mishra, Meltem Sönmez Turan:
TMPS: Ticket-Mediated Password Strengthening. 225-253 - Emmanuela Orsini, Nigel P. Smart, Frederik Vercauteren:
Overdrive2k: Efficient Secure MPC over $\mathbb {Z}_{2^k}$ from Somewhat Homomorphic Encryption. 254-283 - Juan A. Garay, Aggelos Kiayias:
SoK: A Consensus Taxonomy in the Blockchain Era. 284-318 - Juan A. Garay, Aggelos Kiayias, Giorgos Panagiotakos:
Consensus from Signatures of Work. 319-344 - Pascal Aubry, Sergiu Carpov, Renaud Sirdey:
Faster Homomorphic Encryption is not Enough: Improved Heuristic for Multiplicative Depth Minimization of Boolean Circuits. 345-363 - Kyoohyung Han, Dohyeong Ki:
Better Bootstrapping for Approximate Homomorphic Encryption. 364-390 - Florian Bourse, Olivier Sanders, Jacques Traoré:
Improved Secure Integer Comparison via Homomorphic Encryption. 391-416 - Daniel Kales, Sebastian Ramacher, Christian Rechberger, Roman Walch, Mario Werner:
Efficient FPGA Implementations of LowMC and Picnic. 417-441 - Hanwen Feng, Jianwei Liu, Qianhong Wu, Yanan Li:
Traceable Ring Signatures with Post-quantum Security. 442-468 - Houda Ferradi, Keita Xagawa:
Post-quantum Provably-Secure Authentication and MAC from Mersenne Primes. 469-495 - Simon-Philipp Merz, Romy M. Minko, Christophe Petit:
Another Look at Some Isogeny Hardness Assumptions. 496-511 - Tomoki Moriya, Hiroshi Onuki, Tsuyoshi Takagi:
How to Construct CSIDH on Edwards Curves. 512-537 - Kai Samelin, Daniel Slamanig:
Policy-Based Sanitizable Signatures. 538-563 - Xuan Thanh Do, Duong Hieu Phan, David Pointcheval:
Traceable Inner Product Functional Encryption. 564-585 - Masayuki Fukumitsu, Shingo Hasegawa:
One-More Assumptions Do Not Help Fiat-Shamir-type Signature Schemes in NPROM. 586-609 - Peihan Miao:
Cut-and-Choose for Garbled RAM. 610-637 - Foteini Baldimtsi, Ran Canetti, Sophia Yakoubov:
Universally Composable Accumulators. 638-666 - Antonis Aggelakis, Prastudy Fauzi, Georgios Korfiatis, Panos Louridas, Foteinos Mergoupis-Anagnou, Janno Siim, Michal Zajac:
A Non-interactive Shuffle Argument with Low Trust Assumptions. 667-692
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
