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 29 matches
- 2009
- Laila El Aimani:
On Generic Constructions of Designated Confirmer Signatures. INDOCRYPT 2009: 343-362 - Gildas Avoine, Christian Floerkemeier, Benjamin Martin:
RFID Distance Bounding Multistate Enhancement. INDOCRYPT 2009: 290-307 - Thierry P. Berger, Marine Minier, Benjamin Pousse:
Software Oriented Stream Ciphers Based upon FCSRs in Diversified Mode. INDOCRYPT 2009: 119-135 - Daniel J. Bernstein, Tanja Lange, Ruben Niederhagen, Christiane Peters, Peter Schwabe:
FSBday. INDOCRYPT 2009: 18-38 - Alexandre Berzati, Cécile Canovas-Dumas, Louis Goubin:
Fault Analysis of Rabbit: Toward a Secret Key Leakage. INDOCRYPT 2009: 72-87 - Rishiraj Bhattacharyya, Avradip Mandal, Mridul Nandi:
Indifferentiability Characterization of Hash Functions and Optimal Bounds of Popular Domain Extensions. INDOCRYPT 2009: 199-218 - Olivier Billet, Kaoutar Elkhiyaoui:
Two Attacks against the Ff RFID Protocol. INDOCRYPT 2009: 308-320 - Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji:
Private Interrogation of Devices via Identification Codes. INDOCRYPT 2009: 272-289 - Julien Bringer, Hervé Chabanne, Thomas Icart:
On Physical Obfuscation of Cryptographic Algorithms. INDOCRYPT 2009: 88-103 - Johannes Buchmann, Richard Lindner:
Secure Parameters for SWIFFT. INDOCRYPT 2009: 1-17 - Sanjit Chatterjee, Alfred Menezes, Berkant Ustaoglu:
Reusing Static Keys in Key Agreement Protocols. INDOCRYPT 2009: 39-56 - Hüseyin Demirci, Ihsan Taskin, Mustafa Çoban, Adnan Baysal:
Improved Meet-in-the-Middle Attacks on AES. INDOCRYPT 2009: 144-156 - Orr Dunkelman, Ewan Fleischmann, Michael Gorski, Stefan Lucks:
Related-Key Rectangle Attack of the Full HAS-160 Encryption Mode. INDOCRYPT 2009: 157-168 - Gérald Gavin, Marine Minier:
Oblivious Multi-variate Polynomial Evaluation. INDOCRYPT 2009: 430-442 - Zheng Gong, Pieter H. Hartel, Svetla Nikova, Bo Zhu:
Towards Secure and Practical MACs for Body Sensor Networks. INDOCRYPT 2009: 182-198 - Conrado Porto Lopes Gouvêa, Julio López:
Software Implementation of Pairing-Based Cryptography on Sensor Networks Using the MSP430 Microcontroller. INDOCRYPT 2009: 248-262 - Kota Ideguchi, Dai Watanabe:
Second Preimage Attack on SHAMATA-512. INDOCRYPT 2009: 169-181 - Mahabir Prasad Jhanwar, Rana Barua:
Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree. INDOCRYPT 2009: 233-247 - Takahiro Matsuda, Kanta Matsuura, Jacob C. N. Schuldt:
Efficient Constructions of Signcryption Schemes and Signcryption Composability. INDOCRYPT 2009: 321-342 - Florian Mendel, Tomislav Nad:
A Distinguisher for the Compression Function of SIMD-512. INDOCRYPT 2009: 219-232 - Arpita Patra, Ashish Choudhary, C. Pandu Rangan:
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. INDOCRYPT 2009: 398-417 - Chester Rebeiro, Debdeep Mukhopadhyay, Junko Takahashi, Toshinori Fukunaga:
Cache Timing Attacks on Clefia. INDOCRYPT 2009: 104-118 - Markus Rückert:
Verifiably Encrypted Signatures from RSA without NIZKs. INDOCRYPT 2009: 363-377 - Sumanta Sarkar:
On the Symmetric Negabent Boolean Functions. INDOCRYPT 2009: 136-143 - S. Sharmila Deva Selvi, S. Sree Vivek, J. Shriram, S. Kalaivani, C. Pandu Rangan:
Identity Based Aggregate Signcryption Schemes. INDOCRYPT 2009: 378-397 - Dong Su, Kewei Lv:
A New Hard-Core Predicate of Paillier's Trapdoor Function. INDOCRYPT 2009: 263-271 - Colleen Swanson, David Jao:
A Study of Two-Party Certificateless Authenticated Key-Agreement Protocols. INDOCRYPT 2009: 57-71 - Huafei Zhu, Feng Bao:
Non-committing Encryptions Based on Oblivious Naor-Pinkas Cryptosystems. INDOCRYPT 2009: 418-429 - Bimal K. Roy, Nicolas Sendrier:
Progress in Cryptology - INDOCRYPT 2009, 10th International Conference on Cryptology in India, New Delhi, India, December 13-16, 2009. Proceedings. Lecture Notes in Computer Science 5922, Springer 2009, ISBN 978-3-642-10627-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.
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-11-26 09:30 CET 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