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 27 matches
- 2015
- Marcin Andrychowicz, Ivan Damgård, Stefan Dziembowski, Sebastian Faust, Antigoni Polychroniadou:
Efficient Leakage Resilient Circuit Compilers. CT-RSA 2015: 311-329 - Nuttapong Attrapadung, Shota Yamada:
Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings. CT-RSA 2015: 87-105 - Christof Beierle, Philipp Jovanovic, Martin M. Lauridsen, Gregor Leander, Christian Rechberger:
Analyzing Permutations for AES-like Ciphers: Understanding ShiftRows. CT-RSA 2015: 37-58 - Olivier Blazy, Céline Chevalier, Damien Vergnaud:
Non-Interactive Zero-Knowledge Proofs of Non-Membership. CT-RSA 2015: 145-164 - Billy Bob Brumley:
Cache Storage Attacks. CT-RSA 2015: 22-34 - Guilhem Castagnos, Fabien Laguillaumie:
Linearly Homomorphic Encryption from $$\mathsf {DDH}$$. CT-RSA 2015: 487-505 - David Derler, Christian Hanser, Daniel Slamanig:
Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives. CT-RSA 2015: 127-144 - Christoph Dobraunig, Maria Eichlseder, Florian Mendel, Martin Schläffer:
Cryptanalysis of Ascon. CT-RSA 2015: 371-387 - Xiaoyang Dong, Leibo Li, Keting Jia, Xiaoyun Wang:
Improved Attacks on Reduced-Round Camellia-128/192/256. CT-RSA 2015: 59-83 - Essam Ghadafi:
Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions. CT-RSA 2015: 391-409 - Conrado Porto Lopes Gouvêa, Julio López:
Implementing GCM on ARMv8. CT-RSA 2015: 167-180 - Neil Hanley, HeeSeok Kim, Michael Tunstall:
Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace. CT-RSA 2015: 431-448 - Jonathan Katz, Stefan Lucks, Aishwarya Thiruvengadam:
Hash Functions from Defective Ideal Ciphers. CT-RSA 2015: 273-290 - Aggelos Kiayias, Nikos Leonardos, Helger Lipmaa, Kateryna Pavlyk, Qiang Tang:
Communication Optimal Tardos-Based Asymmetric Fingerprinting. CT-RSA 2015: 469-486 - Handan Kilinç, Alptekin Küpçü:
Optimally Efficient Multi-Party Fair Exchange and Fair Secure Multi-Party Computation. CT-RSA 2015: 330-349 - Fuyuki Kitagawa, Takahiro Matsuda, Goichiro Hanaoka, Keisuke Tanaka:
Completeness of Single-Bit Projection-KDM Security for Public Key Encryption. CT-RSA 2015: 201-219 - Florian Maury, Jean-René Reinhard, Olivier Levillain, Henri Gilbert:
Format Oracles on OpenPGP. CT-RSA 2015: 220-236 - Koji Nuida, Naoto Itakura, Kaoru Kurosawa:
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints. CT-RSA 2015: 258-269 - Satsuya Ohata, Yutaka Kawai, Takahiro Matsuda, Goichiro Hanaoka, Kanta Matsuura:
Re-Encryption Verifiability: How to Detect Malicious Activities of a Proxy in Proxy Re-Encryption. CT-RSA 2015: 410-428 - Bertram Poettering, Dale L. Sibborn:
Cold Boot Attacks in the Discrete Logarithm Setting. CT-RSA 2015: 449-465 - Joop van de Pol, Nigel P. Smart, Yuval Yarom:
Just a Little Bit More. CT-RSA 2015: 3-21 - Yu Sasaki, Kan Yasuda:
How to Incorporate Associated Data in Sponge-Based Authenticated Encryption. CT-RSA 2015: 353-370 - Jae Hong Seo, Keita Emura:
Revocable Hierarchical Identity-Based Encryption: History-Free Update, Security Against Insiders, and Short Ciphertexts. CT-RSA 2015: 106-123 - Junwei Wang, Praveen Kumar Vadnala, Johann Großschädl, Qiuliang Xu:
Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON. CT-RSA 2015: 181-198 - Wei Wei, Mingjie Liu, Xiaoyun Wang:
Finding Shortest Lattice Vectors in the Presence of Gaps. CT-RSA 2015: 239-257 - Yusi Zhang:
Using an Error-Correction Code for Fast, Beyond-Birthday-Bound Authentication. CT-RSA 2015: 291-307 - Kaisa Nyberg:
Topics in Cryptology - CT-RSA 2015, The Cryptographer's Track at the RSA Conference 2015, San Francisco, CA, USA, April 20-24, 2015. Proceedings. Lecture Notes in Computer Science 9048, Springer 2015, ISBN 978-3-319-16714-5 [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-04 23:04 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