


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 25 matches
- 2022
- Shahla Atapoor
, Nigel P. Smart
, Younes Talibi Alaoui
:
Private Liquidity Matching Using MPC. CT-RSA 2022: 96-119 - Alexander Bienstock, Yevgeniy Dodis, Yi Tang:
Multicast Key Agreement, Revisited. CT-RSA 2022: 1-25 - Jannis Bossert, Eik List, Stefan Lucks, Sebastian Schmitz:
Pholkos - Efficient Large-State Tweakable Block Ciphers from the AES Round Function. CT-RSA 2022: 511-536 - Marek Broll, Federico Canale, Nicolas David, Antonio Flórez-Gutiérrez, Gregor Leander
, María Naya-Plasencia, Yosuke Todo:
New Attacks from Old Distinguishers Improved Attacks on Serpent. CT-RSA 2022: 484-510 - Xavier Bultel
:
CCA Secure A Posteriori Openable Encryption in the Standard Model. CT-RSA 2022: 370-394 - Weiqiong Cao, Hongsong Shi, Hua Chen, Jiazhe Chen
, Limin Fan, Wenling Wu:
Lattice-Based Fault Attacks on Deterministic Signature Schemes of ECDSA and EdDSA. CT-RSA 2022: 169-195 - Benoît Chevallier-Mames:
A Pairing-Free Signature Scheme from Correlation Intractable Hash Function and Strong Diffie-Hellman Assumption. CT-RSA 2022: 26-48 - Jesús-Javier Chi-Domínguez
, Krijn Reijnders:
Fully Projective Radical Isogenies in Constant-Time. CT-RSA 2022: 73-95 - Chitchanok Chuengsatiansup, Daniel Genkin, Yuval Yarom, Zhiyuan Zhang
:
Side-Channeling the Kalyna Key Expansion. CT-RSA 2022: 272-296 - Carlos Cid
, John Petter Indrøy, Håvard Raddum
:
FASTA - A Stream Cipher for Fast FHE Evaluation. CT-RSA 2022: 451-483 - Jiamin Cui, Kai Hu, Qingju Wang, Meiqin Wang:
Integral Attacks on Pyjamask-96 and Round-Reduced Pyjamask-128. CT-RSA 2022: 223-246 - Rami Elkhatib, Brian Koziel, Reza Azarderakhsh:
Faster Isogenies for Post-quantum Cryptography: SIKE. CT-RSA 2022: 49-72 - Yanhong Fan, Muzhou Li
, Chao Niu, Zhenyu Lu, Meiqin Wang:
Related-Tweakey Impossible Differential Attack on Reduced-Round SKINNY-AEAD M1/M3. CT-RSA 2022: 247-271 - Antonio Faonio
, Dario Fiore, Luca Nizzardo, Claudio Soriente:
Subversion-Resilient Enhanced Privacy ID. CT-RSA 2022: 562-588 - Tako Boris Fouotsa
, Christophe Petit
:
A New Adaptive Attack on SIDH. CT-RSA 2022: 322-344 - David Galindo
, Jia Liu
:
Robust Subgroup Multi-signatures for Consensus. CT-RSA 2022: 537-561 - Kai Gellert, Tibor Jager, Lin Lyu, Tom Neuschulten:
On Fingerprinting Attacks and Length-Hiding Encryption. CT-RSA 2022: 345-369 - Kristian Gjøsteen, Mayank Raikwar, Shuang Wu:
PriBank: Confidential Blockchain Scaling Using Short Commit-and-Proof NIZK Argument. CT-RSA 2022: 589-619 - Andrey Kim, Antonis Papadimitriou, Yuriy Polyakov
:
Approximate Homomorphic Encryption with Reduced Approximation Error. CT-RSA 2022: 120-144 - Florette Martinez:
Attacks on Pseudo Random Number Generators Hiding a Linear Structure. CT-RSA 2022: 145-168 - Naila Mukhtar
, Lejla Batina, Stjepan Picek
, Yinan Kong:
Fake It Till You Make It: Data Augmentation Using Generative Adversarial Networks for All the Crypto You Need on Small Devices. CT-RSA 2022: 297-321 - Razvan Rosie:
Adaptively Secure Laconic Function Evaluation for NC1. CT-RSA 2022: 427-450 - Giuseppe Vitto, Alex Biryukov
:
Dynamic Universal Accumulator with Batch Update over Bilinear Groups. CT-RSA 2022: 395-426 - Han Wu
, Guangwu Xu:
More Accurate Geometric Analysis on the Impact of Successful Decryptions for IND-CCA Secure Ring/Mod-LWE/LWR Based Schemes. CT-RSA 2022: 196-222 - Steven D. Galbraith
:
Topics in Cryptology - CT-RSA 2022 - Cryptographers' Track at the RSA Conference 2022, Virtual Event, March 1-2, 2022, Proceedings. Lecture Notes in Computer Science 13161, Springer 2022, ISBN 978-3-030-95311-9 [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-08-14 22:58 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
