Остановите войну!
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 40 matches
- 2003
- Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford:
CAPTCHA: Using Hard AI Problems for Security. EUROCRYPT 2003: 294-311 - Daniel Augot, Matthieu Finiasz:
A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem. EUROCRYPT 2003: 229-240 - Mihir Bellare, Tadayoshi Kohno:
A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications. EUROCRYPT 2003: 491-506 - Mihir Bellare, Daniele Micciancio, Bogdan Warinschi:
Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions. EUROCRYPT 2003: 614-629 - Alex Biryukov, Christophe De Cannière, An Braeken, Bart Preneel:
A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. EUROCRYPT 2003: 33-50 - Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham:
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. EUROCRYPT 2003: 416-432 - Ran Canetti, Shai Halevi, Jonathan Katz:
A Forward-Secure Public-Key Encryption Scheme. EUROCRYPT 2003: 255-271 - Ran Canetti, Eyal Kushilevitz, Yehuda Lindell:
On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86 - Mathieu Ciet, Tanja Lange, Francesco Sica, Jean-Jacques Quisquater:
Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms. EUROCRYPT 2003: 388-400 - Nicolas T. Courtois, Willi Meier:
Algebraic Attacks on Stream Ciphers with Linear Feedback. EUROCRYPT 2003: 345-359 - Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz:
Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613 - Yevgeniy Dodis, Jee Hea An:
Concealment and Its Applications to Authenticated Encryption. EUROCRYPT 2003: 312-329 - Patrik Ekdahl, Willi Meier, Thomas Johansson:
Predicting the Shrinking Generator with Fixed Connections. EUROCRYPT 2003: 330-344 - Matthias Fitzi, Martin Hirt, Thomas Holenstein, Jürg Wullschleger:
Two-Threshold Broadcast and Detectable Multi-party Computation. EUROCRYPT 2003: 51-67 - Pierre-Alain Fouque, Guillaume Poupard:
On the Security of RDSA. EUROCRYPT 2003: 462-476 - Kris Gaj, Arkadiusz Orlowski:
Facts and Myths of Enigma: Breaking Stereotypes. EUROCRYPT 2003: 106-122 - Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT 2003: 177-194 - Rosario Gennaro, Yehuda Lindell:
A Framework for Password-Based Authenticated Key Exchange. EUROCRYPT 2003: 524-543 - Craig Gentry:
Certificate-Based Encryption and the Certificate Revocation Problem. EUROCRYPT 2003: 272-293 - Eu-Jin Goh, Stanislaw Jarecki:
A Signature Scheme as Secure as the Diffie-Hellman Problem. EUROCRYPT 2003: 401-415 - Gustav Hast:
Nearly One-Sided Tests and the Goldreich-Levin Predicate. EUROCRYPT 2003: 195-210 - Florian Hess:
The GHS Attack Revisited. EUROCRYPT 2003: 374-387 - Antoine Joux:
Cryptanalysis of the EMD Mode of Operation. EUROCRYPT 2003: 1-16 - Pascal Junod:
On the Optimality of Linear, Differential, and Sequential Distinguishers. EUROCRYPT 2003: 17-32 - Jonathan Katz:
Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications. EUROCRYPT 2003: 211-228 - Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Round Efficiency of Multi-party Computation with a Dishonest Majority. EUROCRYPT 2003: 578-595 - Aggelos Kiayias, Moti Yung:
Extracting Group Signatures from Traitor Tracing Schemes. EUROCRYPT 2003: 630-648 - Eonkyung Lee, Je Hong Park:
Cryptanalysis of the Public-Key Encryption Based on Braid Groups. EUROCRYPT 2003: 477-490 - Reynald Lercier, David Lubicz:
Counting Points on Elliptic Curves over Finite Fields of Small Characteristic in Quasi Quadratic Time. EUROCRYPT 2003: 360-373 - Yehuda Lindell:
A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions. EUROCRYPT 2003: 241-254
skipping 10 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-04-25 07:24 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