


default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2021
- Alexander May
, Lars Schlieper
, Jonathan Schwinger:
Noisy Simon Period Finding. CT-RSA 2021: 75-99 - Damiano Abram
, Ivan Damgård, Peter Scholl, Sven Trieflinger:
Oblivious TLS via Multi-party Computation. CT-RSA 2021: 51-74 - Martin R. Albrecht, Jorge Blasco, Rikke Bjerg Jensen, Lenka Mareková
:
Mesh Messaging in Large-Scale Protests: Breaking Bridgefy. CT-RSA 2021: 375-398 - Diego F. Aranha
, Carsten Baum
, Kristian Gjøsteen
, Tjerand Silde
, Thor Tunge:
Lattice-Based Proof of Shuffle and Applications to Electronic Voting. CT-RSA 2021: 227-251 - Benedikt Auerbach
, Suvradip Chakraborty, Karen Klein
, Guillermo Pascual-Perez
, Krzysztof Pietrzak, Michael Walter
, Michelle Yeo
:
Inverse-Sybil Attacks in Automated Contact Tracing. CT-RSA 2021: 399-421 - Karim Baghery
, Cyprien Delpech de Saint Guilhem
, Emmanuela Orsini
, Nigel P. Smart
, Titouan Tanguy
:
Compilation of Function Representations for Secure Computing Paradigms. CT-RSA 2021: 26-50 - Alex Biryukov
, Aleksei Udovenko
, Giuseppe Vitto:
Cryptanalysis of a Dynamic Universal Accumulator over Bilinear Groups. CT-RSA 2021: 276-298 - Katharina Boudgoust
, Corentin Jeudy
, Adeline Roux-Langlois
, Weiqiang Wen
:
On the Hardness of Module-LWE with Binary Secret. CT-RSA 2021: 503-526 - Konstantinos Chalkias, François Garillot
, Yashvanth Kondi, Valeria Nikolaenko:
Non-interactive Half-Aggregation of EdDSA and Variants of Schnorr Signatures. CT-RSA 2021: 577-608 - Anupam Chattopadhyay, Mustafa Khairallah
, Gaëtan Leurent, Zakaria Najm, Thomas Peyrin
, Vesselin Velichkov:
On the Cost of ASIC Hardware Crackers: A SHA-1 Case Study. CT-RSA 2021: 657-681 - Daniele Cozzo
, Nigel P. Smart
, Younes Talibi Alaoui
:
Secure Fast Evaluation of Iterative Methods: With an Application to Secure PageRank. CT-RSA 2021: 1-25 - Ivan Damgård, Chaya Ganesh, Hamidreza Khoshakhlagh
, Claudio Orlandi, Luisa Siniscalchi
:
Balancing Privacy and Accountability in Blockchain Identity Management. CT-RSA 2021: 552-576 - Pooya Farshim, Louiza Khati, Yannick Seurin, Damien Vergnaud
:
The Key-Dependent Message Security of Key-Alternating Feistel Ciphers. CT-RSA 2021: 351-374 - Mike Hamburg, Mike Tunstall
, Qinglai Xiao:
Improvements to RSA Key Generation and CRT on Embedded Devices. CT-RSA 2021: 633-656 - Lukas Helminger, Daniel Kales
, Sebastian Ramacher
, Roman Walch:
Multi-party Revocation in Sovrin: Performance through Distributed Trust. CT-RSA 2021: 527-551 - James Howe
, Thomas Prest
, Daniel Apon:
SoK: How (not) to Design and Implement Post-quantum Cryptography. CT-RSA 2021: 444-477 - Vincenzo Iovino, Serge Vaudenay, Martin Vuagnoux:
On the Effectiveness of Time Travel to Inject COVID-19 Alerts. CT-RSA 2021: 422-443 - Lin Jiao
, Dengguo Feng, Yonglin Hao, Xinxin Gong, Shaoyu Du:
FAN: A Lightweight Authenticated Cryptographic Algorithm. CT-RSA 2021: 299-325 - Toomas Krips, Helger Lipmaa:
More Efficient Shuffle Argument from Unique Factorization. CT-RSA 2021: 252-275 - Thijs Laarhoven
, Michael Walter
:
Dual Lattice Attacks for Closest Vector Problems (with Preprocessing). CT-RSA 2021: 478-502 - Da Lin
, Zejun Xiang
, Xiangyong Zeng, Shasha Zhang:
A Framework to Optimize Implementations of Matrices. CT-RSA 2021: 609-632 - Chao Niu
, Muzhou Li
, Siwei Sun, Meiqin Wang:
Zero-Correlation Linear Cryptanalysis with Equal Treatment for Plaintexts and Tweakeys. CT-RSA 2021: 126-147 - Jiaxin Pan
, Chen Qian, Magnus Ringerud
:
Signed Diffie-Hellman Key Exchange with Tight Security. CT-RSA 2021: 201-226 - Bertram Poettering
, Paul Rösler
, Jörg Schwenk
, Douglas Stebila
:
SoK: Game-Based Security Models for Group Key Exchange. CT-RSA 2021: 148-176 - Olivier Sanders, Jacques Traoré:
EPID with Malicious Revocation. CT-RSA 2021: 177-200 - Marloes Venema
, Greg Alpár:
A Bunch of Broken Schemes: A Simple yet Powerful Linear Approach to Analyzing Security of Attribute-Based Encryption. CT-RSA 2021: 100-125 - Yuqing Zhao, Wenqi Yu, Chun Guo:
Related-Key Analysis of Generalized Feistel Networks with Expanding Round Functions. CT-RSA 2021: 326-350 - Kenneth G. Paterson:
Topics in Cryptology - CT-RSA 2021 - Cryptographers' Track at the RSA Conference 2021, Virtual Event, May 17-20, 2021, Proceedings. Lecture Notes in Computer Science 12704, Springer 2021, ISBN 978-3-030-75538-6 [contents]
loading more results
failed to load more results, please try again later

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.
[+][–] Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-07-29 21:05 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
