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 35 matches
- 1996
- William Aiello, Ramarathnam Venkatesan:
Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel. EUROCRYPT 1996: 307-320 - Donald Beaver:
Equivocable Oblivious Transfer. EUROCRYPT 1996: 119-130 - Mihir Bellare, Phillip Rogaway:
The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin. EUROCRYPT 1996: 399-416 - Simon R. Blackburn, Mike Burmester, Yvo Desmedt, Peter R. Wild:
Efficient Multiplicative Sharing Schemes. EUROCRYPT 1996: 107-118 - Daniel Bleichenbacher:
Generating EIGamal Signatures Without Knowing the Secret Key. EUROCRYPT 1996: 10-18 - Joan Boyar, René Peralta:
Short Discrete Proofs. EUROCRYPT 1996: 131-142 - Mike Burmester:
Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing. EUROCRYPT 1996: 96-106 - Paul Camion, Anne Canteaut:
Construction of t-Resilient Functions over a Finite Alphabet. EUROCRYPT 1996: 283-293 - Don Coppersmith:
Finding a Small Root of a Univariate Modular Equation. EUROCRYPT 1996: 155-165 - Don Coppersmith:
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known. EUROCRYPT 1996: 178-189 - Don Coppersmith, Matthew K. Franklin, Jacques Patarin, Michael K. Reiter:
Low-Exponent RSA with Related Messages. EUROCRYPT 1996: 1-9 - Ronald Cramer, Matthew K. Franklin, Berry Schoenmakers, Moti Yung:
Multi-Autority Secret-Ballot Elections with Linear Work. EUROCRYPT 1996: 72-83 - Ivan Damgård, Torben P. Pedersen:
New Convertible Undeniable Signature Schemes. EUROCRYPT 1996: 372-386 - Jean-Bernard Fischer, Jacques Stern:
An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding. EUROCRYPT 1996: 245-255 - Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin:
Robust Threshold DSS Signatures. EUROCRYPT 1996: 354-371 - Keith Gibson:
The Security of the Gabidulin Public Key Cryptosystem. EUROCRYPT 1996: 212-223 - Jovan Dj. Golic:
Fast Low Order Approximation of Cryptographic Functions. EUROCRYPT 1996: 268-282 - Seong-Min Hong, Sang-Yeop Oh, Hyunsoo Yoon:
New Modular Multiplication Algorithms for Fast Modular Exponentiation. EUROCRYPT 1996: 166-177 - Markus Jakobsson, Kazue Sako, Russell Impagliazzo:
Designated Verifier Proofs and Their Applications. EUROCRYPT 1996: 143-154 - Andrew Klapper:
On the Existence of Secure Feedback Registers (Extended Abstract). EUROCRYPT 1996: 256-267 - Lars R. Knudsen, Torben P. Pedersen:
On the Difficulty of Software Key Escrow. EUROCRYPT 1996: 237-244 - Lars R. Knudsen, Matthew J. B. Robshaw:
Non-Linear Approximations in Linear Cryptanalysis. EUROCRYPT 1996: 224-236 - Bernd Meyer, Volker Müller:
A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring. EUROCRYPT 1996: 49-59 - Wakaha Ogata, Kaoru Kurosawa:
Optimum Secret Sharing Scheme Secure against Cheating. EUROCRYPT 1996: 200-211 - Paul C. van Oorschot, Michael J. Wiener:
On Diffie-Hellman Key Agreement with Short Exponents. EUROCRYPT 1996: 332-343 - Jacques Patarin:
Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. EUROCRYPT 1996: 33-48 - Birgit Pfitzmann, Matthias Schunter:
Asymmetric Fingerprinting (Extended Abstract). EUROCRYPT 1996: 84-95 - David Pointcheval, Jacques Stern:
Security Proofs for Signature Schemes. EUROCRYPT 1996: 387-398 - Bart Preneel, Paul C. van Oorschot:
On the Security of Two MAC Algorithms. EUROCRYPT 1996: 19-32 - Jörg Schwenk, Jörg Eisfeld:
Public Key Encryption and Signature Schemes Based on Polynomials over Zn. EUROCRYPT 1996: 60-71
skipping 5 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-28 13:46 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