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 32 matches
- 2008
- Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer:
Second Preimage Attacks on Dithered Hash Functions. EUROCRYPT 2008: 270-288 - Boaz Barak, Sharon Goldberg, David Xiao:
Protocols and Lower Bounds for Failure Localization in the Internet. EUROCRYPT 2008: 341-360 - Daniel J. Bernstein:
Proving Tight Security for Rabin-Williams Signatures. EUROCRYPT 2008: 70-87 - Guido Bertoni, Joan Daemen, Michaël Peeters, Gilles Van Assche:
On the Indifferentiability of the Sponge Construction. EUROCRYPT 2008: 181-197 - Ran Canetti, Ronny Ramzi Dakdouk:
Obfuscating Point Functions with Multibit Output. EUROCRYPT 2008: 489-508 - David Cash, Eike Kiltz, Victor Shoup:
The Twin Diffie-Hellman Problem and Applications. EUROCRYPT 2008: 127-145 - Dario Catalano, Dario Fiore, Mariagrazia Messina:
Zero-Knowledge Sets with Short Proofs. EUROCRYPT 2008: 433-450 - Nishanth Chandran, Vipul Goyal, Amit Sahai:
New Constructions for UC Secure Computation Using Tamper-Proof Hardware. EUROCRYPT 2008: 545-562 - Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo Pueyo:
Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. EUROCRYPT 2008: 451-470 - Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. EUROCRYPT 2008: 471-488 - Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Isolated Proofs of Knowledge and Isolated Zero Knowledge. EUROCRYPT 2008: 509-526 - Yevgeniy Dodis, Krzysztof Pietrzak, Prashant Puniya:
A New Mode of Operation for Block Ciphers and Length-Preserving MACs. EUROCRYPT 2008: 198-219 - Pierre-Alain Fouque, Gilles Macario-Rat, Jacques Stern:
Key Recovery on Hidden Monomial Multivariate Schemes. EUROCRYPT 2008: 19-30 - Nicolas Gama, Phong Q. Nguyen:
Predicting Lattice Reduction. EUROCRYPT 2008: 31-51 - Juan A. Garay, Rafail Ostrovsky:
Almost-Everywhere Secure Computation. EUROCRYPT 2008: 307-323 - Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal Rabin:
Threshold RSA for Dynamic and Ad-Hoc Groups. EUROCRYPT 2008: 88-107 - Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
HB#: Increasing the Security and Efficiency of HB+. EUROCRYPT 2008: 361-378 - Vipul Goyal, Payman Mohassel, Adam D. Smith:
Efficient Two Party and Multi Party Computation Against Covert Adversaries. EUROCRYPT 2008: 289-306 - Jens Groth, Yuval Ishai:
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. EUROCRYPT 2008: 379-396 - Jens Groth, Amit Sahai:
Efficient Non-interactive Proof Systems for Bilinear Groups. EUROCRYPT 2008: 415-432 - Dennis Hofheinz, Dominique Unruh:
Towards Key-Dependent Message Security in the Standard Model. EUROCRYPT 2008: 108-126 - Sebastiaan Indesteege, Nathan Keller, Orr Dunkelman, Eli Biham, Bart Preneel:
A Practical Attack on KeeLoq. EUROCRYPT 2008: 1-18 - Jonathan Katz, Amit Sahai, Brent Waters:
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. EUROCRYPT 2008: 146-162 - Kaoru Kurosawa, Kazuhiro Suzuki:
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. EUROCRYPT 2008: 324-340 - Tal Moran, Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. EUROCRYPT 2008: 527-544 - Gregory Neven:
Efficient Sequential Aggregate Signed Data. EUROCRYPT 2008: 52-69 - Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Precise Concurrent Zero Knowledge. EUROCRYPT 2008: 397-414 - Phillip Rogaway, John P. Steinberger:
Security/Efficiency Tradeoffs for Permutation-Based Hashing. EUROCRYPT 2008: 220-236 - Benjamin A. Smith:
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. EUROCRYPT 2008: 163-180 - Jean-Pierre Tillich, Gilles Zémor:
Collisions for the LPS Expander Graph Hash Function. EUROCRYPT 2008: 254-269
skipping 2 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-11-02 16:30 CET 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