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 33 matches
- 2001
- Masayuki Abe:
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures. EUROCRYPT 2001: 136-151 - William Aiello, Yuval Ishai, Omer Reingold:
Priced Oblivious Transfer: How to Sell Digital Goods. EUROCRYPT 2001: 119-135 - Jee Hea An, Mihir Bellare:
Does Encryption with Redundancy Provide Authenticity? EUROCRYPT 2001: 512-528 - Mihir Bellare, Marc Fischlin, Shafi Goldwasser, Silvio Micali:
Identification Protocols Secure against Reset Attacks. EUROCRYPT 2001: 495-511 - Eli Biham, Orr Dunkelman, Nathan Keller:
The Rectangle Attack - Rectangling the Serpent. EUROCRYPT 2001: 340-357 - Alex Biryukov, Adi Shamir:
Structural Cryptanalysis of SASAS. EUROCRYPT 2001: 394-405 - Dan Boneh, Glenn Durfee, Matthew K. Franklin:
Lower Bounds for Multicast Message Authentication. EUROCRYPT 2001: 437-452 - Jan Camenisch, Anna Lysyanskaya:
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation. EUROCRYPT 2001: 93-118 - Ran Canetti, Ivan Damgård, Stefan Dziembowski, Yuval Ishai, Tal Malkin:
On Adaptive vs. Non-adaptive Security of Multiparty Protocols. EUROCRYPT 2001: 262-279 - Ran Canetti, Hugo Krawczyk:
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. EUROCRYPT 2001: 453-474 - Dario Catalano, Rosario Gennaro, Nick Howgrave-Graham:
The Bit Security of Paillier's Encryption Scheme and Its Applications. EUROCRYPT 2001: 229-243 - Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen:
Multiparty Computation from Threshold Homomorphic Encryption. EUROCRYPT 2001: 280-299 - Claude Crépeau, Frédéric Légaré, Louis Salvail:
How to Convert the Flavor of a Quantum Bit Commitment. EUROCRYPT 2001: 60-77 - Giovanni Di Crescenzo, Jonathan Katz, Rafail Ostrovsky, Adam D. Smith:
Efficient and Non-interactive Non-malleable Commitment. EUROCRYPT 2001: 40-59 - Ivan Damgård, Maciej Koprowski:
Practical Threshold RSA Signatures without a Trusted Dealer. EUROCRYPT 2001: 152-165 - Yevgeniy Dodis, Amit Sahai, Adam D. Smith:
On Perfect and Adaptive Security in Exposure-Resilient Cryptography. EUROCRYPT 2001: 301-324 - Mireille Fouquet, Pierrick Gaudry, Robert Harley:
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy. EUROCRYPT 2001: 14-29 - Craig Gentry:
Key Recovery and Message Attacks on NTRU-Composite. EUROCRYPT 2001: 182-194 - Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman:
NSS: An NTRU Lattice-Based Signature Scheme. EUROCRYPT 2001: 211-228 - Charanjit S. Jutla:
Encryption Modes with Almost Free Message Integrity. EUROCRYPT 2001: 529-544 - Jonathan Katz, Steven A. Myers, Rafail Ostrovsky:
Cryptographic Counters and Applications to Electronic Voting. EUROCRYPT 2001: 78-92 - Jonathan Katz, Rafail Ostrovsky, Moti Yung:
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords. EUROCRYPT 2001: 475-494 - Liam Keliher, Henk Meijer, Stafford E. Tavares:
New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs. EUROCRYPT 2001: 420-436 - Ulrich Kühn:
Cryptanalysis of Reduced-Round MISTY. EUROCRYPT 2001: 325-339 - Silvio Micali, Leonid Reyzin:
Min-round Resettable Zero-Knowledge in the Public-Key Model. EUROCRYPT 2001: 373-393 - Ilya Mironov:
Hash Functions: From Merkle-Damgård to Shoup. EUROCRYPT 2001: 166-181 - Steven A. Myers:
Efficient Amplification of the Security of Weak Pseudo-random Function Generators. EUROCRYPT 2001: 358-372 - Ahmad-Reza Sadeghi, Michael Steiner:
Assumptions Related to Discrete Logarithms: Why Subtleties Make a Real Difference. EUROCRYPT 2001: 244-261 - Nigel P. Smart:
How Secure Are Elliptic Curves over Composite Extension Fields? EUROCRYPT 2001: 30-39 - Frederik Vercauteren, Bart Preneel, Joos Vandewalle:
A Memory Efficient Version of Satoh's Algorithm. EUROCRYPT 2001: 1-13
skipping 3 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-09-19 08:43 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