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.
Author search results
no matches
Venue search results
no matches
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
- Orr Dunkelman, Michael J. Jacobson Jr., Colin O'Flynn:
Selected Areas in Cryptography - SAC 2020 - 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12804, Springer 2021, ISBN 978-3-030-81651-3 [contents] - 2020
- Elena Andreeva, Amit Singh Bhati, Damian Vizár:
Nonce-Misuse Security of the SAEF Authenticated Encryption Mode. SAC 2020: 512-534 - Subhadeep Banik, Zhenzhen Bao, Takanori Isobe, Hiroyasu Kubo, Fukang Liu, Kazuhiko Minematsu, Kosei Sakamoto, Nao Shibata, Maki Shigeri:
WARP : Revisiting GFN for Lightweight 128-Bit Block Cipher. SAC 2020: 535-564 - Gal Benmocha, Eli Biham, Stav Perle:
Unintended Features of APIs: Cryptanalysis of Incremental HMAC. SAC 2020: 301-325 - Ward Beullens:
Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over $\mathbb {F}_q$. SAC 2020: 387-403 - Dusan Bozilov, Maria Eichlseder, Miroslav Knezevic, Baptiste Lambin, Gregor Leander, Thorben Moos, Ventzislav Nikov, Shahram Rasoolzadeh, Yosuke Todo, Friedrich Wiemer:
PRINCEv2 - More Security for (Almost) No Overhead. SAC 2020: 483-511 - Jacqueline Brendel, Marc Fischlin, Felix Günther, Christian Janson, Douglas Stebila:
Towards Post-Quantum Security for Signal's X3DH Handshake. SAC 2020: 404-430 - Hao Cheng, Johann Großschädl, Jiaqi Tian, Peter B. Rønne, Peter Y. A. Ryan:
High-Throughput Elliptic Curve Cryptography Using AVX2 Vector Instructions. SAC 2020: 698-719 - Tingting Cui, Lorenzo Grassi:
Algebraic Key-Recovery Attacks on Reduced-Round Xoofff. SAC 2020: 171-197 - James H. Davenport, Benjamin Pring:
Improvements to Quantum Search Techniques for Block-Ciphers, with Applications to AES. SAC 2020: 360-384 - Yunsi Fei, Guang Gong, Cheng Gongye, Kalikinkar Mandal, Raghvendra Rohit, Tianhong Xu, Yunjie Yi, Nusa Zidaric:
Correlation Power Analysis and Higher-Order Masking Implementation of WAGE. SAC 2020: 593-614 - Ashley Fraser, Elizabeth A. Quaglia:
Protecting the Privacy of Voters: New Definitions of Ballot Secrecy for E-Voting. SAC 2020: 670-697 - Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit:
On Index Calculus Algorithms for Subfield Curves. SAC 2020: 115-138 - Steven D. Galbraith, Lukas Zobernig:
Obfuscating Finite Automata. SAC 2020: 90-114 - Aron Gohr, Sven Jacob, Werner Schindler:
Subsampling and Knowledge Distillation on Adversarial Examples: New Techniques for Deep Learning Based Side Channel Evaluations. SAC 2020: 567-592 - Lorenzo Grassi, Gregor Leander, Christian Rechberger, Cihangir Tezcan, Friedrich Wiemer:
Weak-Key Distinguishers for AES. SAC 2020: 141-170 - John Petter Indrøy, Nicolas Costes, Håvard Raddum:
Boolean Polynomials, BDDs and CRHS Equations - Connecting the Dots with CryptaPath. SAC 2020: 229-251 - Samuel Jaques, André Schrottenloher:
Low-Gate Quantum Golden Collision Finding. SAC 2020: 329-359 - Fulei Ji, Wentao Zhang, Chunning Zhou, Tianyou Ding:
Improved (Related-key) Differential Cryptanalysis on GIFT. SAC 2020: 198-228 - Bor de Kock, Kristian Gjøsteen, Mattia Veroni:
Practical Isogeny-Based Key-Exchange with Optimal Tightness. SAC 2020: 451-479 - Chelsea Komlo, Ian Goldberg:
FROST: Flexible Round-Optimized Schnorr Threshold Signatures. SAC 2020: 34-65 - Veronika Kuchta, Amin Sakzad, Ron Steinfeld, Joseph K. Liu:
Efficient Lattice-Based Polynomial Evaluation and Batch ZK Arguments. SAC 2020: 3-33 - Péter Kutas, Christophe Petit, Javier Silva:
Trapdoor DDH Groups from Pairings and Isogenies. SAC 2020: 431-450 - Sean Murphy, Maura B. Paterson, Christine Swart:
Boolean Ring Cryptographic Equation Solving. SAC 2020: 252-272 - Guilherme Perin, Stjepan Picek:
On the Influence of Optimizers in Deep Learning-Based Side-Channel Analysis. SAC 2020: 615-636 - Adrián Ranea, Bart Preneel:
On Self-equivalence Encodings in White-Box Implementations. SAC 2020: 639-669 - Arnab Roy, Elena Andreeva, Jan Ferdinand Sauer:
Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions. SAC 2020: 273-300 - Jonathan Takeshita, Dayane Reis, Ting Gong, Michael T. Niemier, X. Sharon Hu, Taeho Jung:
Algorithmic Acceleration of B/FV-Like Somewhat Homomorphic Encryption for Compute-Enabled RAM. SAC 2020: 66-89
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-10-20 17:20 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