Остановите войну!
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 34 matches
- 2005
- Masayuki Abe, Rosario Gennaro, Kaoru Kurosawa, Victor Shoup:
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM. EUROCRYPT 2005: 128-146 - Daniel J. Bernstein:
Stronger Security Bounds for Wegman-Carter-Shoup Authenticators. EUROCRYPT 2005: 164-180 - Eli Biham, Rafi Chen, Antoine Joux, Patrick Carribault, Christophe Lemuet, William Jalby:
Collisions of SHA-0 and Reduced SHA-1. EUROCRYPT 2005: 36-57 - Eli Biham, Orr Dunkelman, Nathan Keller:
Related-Key Boomerang and Rectangle Attacks. EUROCRYPT 2005: 507-525 - John Black, Martin Cochran, Thomas Shrimpton:
On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions. EUROCRYPT 2005: 526-541 - Johannes Blömer, Alexander May:
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. EUROCRYPT 2005: 251-267 - Dan Boneh, Xavier Boyen, Eu-Jin Goh:
Hierarchical Identity Based Encryption with Constant Size Ciphertext. EUROCRYPT 2005: 440-456 - Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Secure Remote Authentication Using Biometric Data. EUROCRYPT 2005: 147-163 - Jan Camenisch, Susan Hohenberger, Anna Lysyanskaya:
Compact E-Cash. EUROCRYPT 2005: 302-321 - Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 - Hervé Chabanne, Duong Hieu Phan, David Pointcheval:
Public Traceability in Traitor Tracing Schemes. EUROCRYPT 2005: 542-558 - Melissa Chase, Alexander Healy, Anna Lysyanskaya, Tal Malkin, Leonid Reyzin:
Mercurial Commitments with Applications to Zero-Knowledge Sets. EUROCRYPT 2005: 422-439 - Claude Crépeau, Daniel Gottesman, Adam D. Smith:
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. EUROCRYPT 2005: 285-301 - Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff:
Practical Cryptography in High Dimensional Tori. EUROCRYPT 2005: 234-250 - Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger:
Partial Key Exposure Attacks on RSA up to Full Size Exponents. EUROCRYPT 2005: 371-386 - Pierre-Alain Fouque, Louis Granboulan, Jacques Stern:
Differential Cryptanalysis for Multivariate Schemes. EUROCRYPT 2005: 341-353 - Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment. EUROCRYPT 2005: 58-77 - Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen:
On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113 - Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek:
Cryptographic Asynchronous Multi-party Computation with Optimal Resilience (Extended Abstract). EUROCRYPT 2005: 322-340 - Nam-Su Jho, Jung Yeon Hwang, Jung Hee Cheon, Myung-Hwan Kim, Dong Hoon Lee, Eun Sun Yoo:
One-Way Chain Based Broadcast Encryption Schemes. EUROCRYPT 2005: 559-574 - Yael Tauman Kalai:
Smooth Projective Hashing and Two-Message Oblivious Transfer. EUROCRYPT 2005: 78-95 - Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami:
Computational Indistinguishability Between Quantum States and Its Cryptographic Application. EUROCRYPT 2005: 268-284 - John Kelsey, Bruce Schneier:
Second Preimages on n-Bit Hash Functions for Much Less than 2n Work. EUROCRYPT 2005: 474-490 - Aggelos Kiayias, Moti Yung:
Group Signatures with Efficient Concurrent Join. EUROCRYPT 2005: 198-214 - Kaoru Kurosawa, Swee-Huay Heng:
3-Move Undeniable Signature Scheme. EUROCRYPT 2005: 181-197 - Itsik Mantin:
Predicting and Distinguishing Attacks on RC4 Keystream Generator. EUROCRYPT 2005: 491-506 - Daniele Micciancio:
The RSA Group is Pseudo-Free. EUROCRYPT 2005: 387-403 - Phong Q. Nguyen, Damien Stehlé:
Floating-Point LLL Revisited. EUROCRYPT 2005: 215-233 - Ludovic Perret:
A Fast Cryptanalysis of the Isomorphism of Polynomials with One Secret Problem. EUROCRYPT 2005: 354-370 - Amit Sahai, Brent Waters:
Fuzzy Identity-Based Encryption. EUROCRYPT 2005: 457-473
skipping 4 more matches
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-05-23 18: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