Остановите войну!
for scientists:
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
- 2008
- Michel Abdalla, Dario Catalano, Céline Chevalier, David Pointcheval:
Efficient Two-Party Password-Based Key Exchange Protocols in the UC Framework. CT-RSA 2008: 335-351 - Onur Aciiçmez, Werner Schindler:
A Vulnerability in RSA Implementations Due to Instruction Cache Analysis and Its Demonstration on OpenSSL. CT-RSA 2008: 256-273 - Emmanuel Bresson, Jean Monnerat, Damien Vergnaud:
Separation Results on the "One-More" Computational Problems. CT-RSA 2008: 71-87 - Christophe Clavier, Benedikt Gierlichs, Ingrid Verbauwhede:
Fault Analysis Study of IDEA. CT-RSA 2008: 274-287 - Ivan Damgård, Dennis Hofheinz, Eike Kiltz, Rune Thorbek:
Public-Key Encryption with Non-interactive Opening. CT-RSA 2008: 239-255 - Ivan Damgård, Michael Østergaard Pedersen:
RFID Security: Tradeoffs between Security and Efficiency. CT-RSA 2008: 318-332 - Marc Fischlin:
Security of NMACand HMACBased on Non-malleability. CT-RSA 2008: 138-154 - Pierre-Alain Fouque, Gaëtan Leurent:
Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes. CT-RSA 2008: 19-35 - Praveen Gauravaram, John Kelsey:
Linear-XOR and Additive Checksums Don't Protect Damgård-Merkle Hashes from Generic Attacks. CT-RSA 2008: 36-51 - Kristian Gjøsteen:
A Latency-Free Election Scheme. CT-RSA 2008: 425-436 - Shafi Goldwasser:
Program Obfuscation and One-Time Programs. CT-RSA 2008: 333-334 - Michael T. Goodrich, Roberto Tamassia, Nikos Triandopoulos:
Super-Efficient Verification of Dynamic Outsourced Databases. CT-RSA 2008: 407-424 - Qiong Huang, Guomin Yang, Duncan S. Wong, Willy Susilo:
Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles. CT-RSA 2008: 106-120 - Kouichi Itoh, Noboru Kunihiro, Kaoru Kurosawa:
Small Secret Key Attack on a Variant of RSA (Due to Takagi). CT-RSA 2008: 387-406 - Stanislaw Jarecki, Jihye Kim, Gene Tsudik:
Beyond Secret Handshakes: Affiliation-Hiding Authenticated Key Exchange. CT-RSA 2008: 352-369 - Jonathan Katz, Andrew Y. Lindell:
Aggregate Message Authentication Codes. CT-RSA 2008: 155-169 - Eike Kiltz, Yevgeniy Vahlis:
CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption. CT-RSA 2008: 221-238 - Mehmet S. Kiraz, Berry Schoenmakers:
An Efficient Protocol for Fair Secure Two-Party Computation. CT-RSA 2008: 88-105 - Robert Könighofer:
A Fast and Cache-Timing Resistant Implementation of the AES. CT-RSA 2008: 187-202 - Andrew Y. Lindell:
Efficient Fully-Simulatable Oblivious Transfer. CT-RSA 2008: 52-70 - Andrew Y. Lindell:
Legally-Enforceable Fairness in Secure Two-Party Computation. CT-RSA 2008: 121-137 - Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunkelman:
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1. CT-RSA 2008: 370-386 - Thomas Plos:
Susceptibility of UHF RFID Tags to Electromagnetic Analysis. CT-RSA 2008: 288-300 - Yu Sasaki, Lei Wang, Kazuo Ohta, Noboru Kunihiro:
Security of MD5 Challenge and Response: Extension of APOP Password Recovery Attack. CT-RSA 2008: 1-18 - Stefan Tillich, Christoph Herbst:
Boosting AES Performance on a Tiny Processor Core. CT-RSA 2008: 170-186 - Jian Weng, Shengli Liu, Kefei Chen, Dong Zheng, Weidong Qiu:
Identity-Based Threshold Key-Insulated Encryption without Random Oracles. CT-RSA 2008: 203-220 - Ping Yu, Stephen R. Tate:
Online/Offline Signature Schemes for Devices with Limited Computing Capabilities. CT-RSA 2008: 301-317 - Tal Malkin:
Topics in Cryptology - CT-RSA 2008, The Cryptographers' Track at the RSA Conference 2008, San Francisco, CA, USA, April 8-11, 2008. Proceedings. Lecture Notes in Computer Science 4964, Springer 2008, ISBN 978-3-540-79262-8 [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-06-02 09:13 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