


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
- 2011
- Hadi Ahmadi, Reihaneh Safavi-Naini:
Secret Keys from Channel Noise. EUROCRYPT 2011: 266-283 - Benny Applebaum:
Key-Dependent Message Security: Generic Amplification and Completeness. EUROCRYPT 2011: 527-546 - Diego F. Aranha
, Koray Karabina, Patrick Longa, Catherine H. Gebotys, Julio López:
Faster Explicit Formulas for Computing Pairings over Ordinary Curves. EUROCRYPT 2011: 48-68 - Gilad Asharov
, Ran Canetti, Carmit Hazay
:
Towards a Game Theoretic View of Secure Computation. EUROCRYPT 2011: 426-445 - Anja Becker, Jean-Sébastien Coron, Antoine Joux
:
Improved Generic Algorithms for Hard Knapsacks. EUROCRYPT 2011: 364-385 - Rikke Bendlin, Ivan Damgård, Claudio Orlandi
, Sarah Zakarias:
Semi-homomorphic Encryption and Multiparty Computation. EUROCRYPT 2011: 169-188 - Dan Boneh, David Mandell Freeman:
Homomorphic Signatures for Polynomial Functions. EUROCRYPT 2011: 149-168 - Niek J. Bouman, Serge Fehr:
Secure Authentication from a Weak Key, without Leaking Information. EUROCRYPT 2011: 246-265 - Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. EUROCRYPT 2011: 89-108 - Dario Catalano, Dario Fiore, Bogdan Warinschi:
Adaptive Pseudo-free Groups and Applications. EUROCRYPT 2011: 207-223 - Ronald Cramer:
The Arithmetic Codex: Theory and Applications. EUROCRYPT 2011: 1 - Yevgeniy Dodis, John P. Steinberger:
Domain Extension for MACs Beyond the Birthday Barrier. EUROCRYPT 2011: 323-342 - Markus Dürmuth
, David Mandell Freeman:
Deniable Encryption with Negligible Detection Probability: An Interactive Construction. EUROCRYPT 2011: 610-626 - Georg Fuchsbauer:
Commuting Signatures and Verifiable Encryption. EUROCRYPT 2011: 224-245 - Craig Gentry, Shai Halevi:
Implementing Gentry's Fully-Homomorphic Encryption Scheme. EUROCRYPT 2011: 129-148 - Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai:
Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425 - Eike Kiltz
, Krzysztof Pietrzak, David Cash, Abhishek Jain, Daniele Venturi
:
Efficient Authentication from Hard Learning Problems. EUROCRYPT 2011: 7-26 - Gregor Leander
:
On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN. EUROCRYPT 2011: 303-322 - Allison B. Lewko, Brent Waters:
Unbounded HIBE and Attribute-Based Encryption. EUROCRYPT 2011: 547-567 - Allison B. Lewko, Brent Waters:
Decentralizing Attribute-Based Encryption. EUROCRYPT 2011: 568-588 - Yehuda Lindell
:
Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption. EUROCRYPT 2011: 446-466 - Tal Malkin, Isamu Teranishi, Moti Yung:
Efficient Circuit-Size Independent Public Key Encryption with KDM Security. EUROCRYPT 2011: 507-526 - Amir Moradi
, Axel Poschmann, San Ling
, Christof Paar, Huaxiong Wang:
Pushing the Limits: A Very Compact and a Threshold Implementation of AES. EUROCRYPT 2011: 69-88 - Phong Q. Nguyen:
Lattice Reduction Algorithms: Theory and Practice. EUROCRYPT 2011: 2-6 - Satoshi Obana:
Almost Optimum t-Cheater Identifiable Secret Sharing Schemes. EUROCRYPT 2011: 284-302 - Mathieu Renauld, François-Xavier Standaert
, Nicolas Veyrat-Charvillon, Dina Kamel, Denis Flandre
:
A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices. EUROCRYPT 2011: 109-128 - Thomas Ristenpart, Hovav Shacham, Thomas Shrimpton:
Careful with Composition: Limitations of the Indifferentiability Framework. EUROCRYPT 2011: 487-506 - Sven Schäge
:
Tight Proofs for Signature Schemes without Random Oracles. EUROCRYPT 2011: 189-206 - Pouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux:
Statistical Attack on RC4 - Distinguishing WPA. EUROCRYPT 2011: 343-363 - Abhi Shelat, Chih-Hao Shen:
Two-Output Secure Computation with Malicious Adversaries. EUROCRYPT 2011: 386-405
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 2025-02-27 07:15 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