


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.
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
- 2005
- Michel Abdalla
, Mihir Bellare, Dario Catalano, Eike Kiltz
, Tadayoshi Kohno, Tanja Lange, John Malone-Lee, Gregory Neven, Pascal Paillier, Haixia Shi:
Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions. CRYPTO 2005: 205-222 - Joël Alwen, Giuseppe Persiano, Ivan Visconti:
Impossibility and Feasibility Results for Zero Knowledge with Public Keys. CRYPTO 2005: 135-151 - Boaz Barak, Ran Canetti, Yehuda Lindell, Rafael Pass, Tal Rabin:
Secure Computation Without Authentication. CRYPTO 2005: 361-377 - Omer Barkol, Yuval Ishai:
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems. CRYPTO 2005: 395-411 - Mihir Bellare, Krzysztof Pietrzak, Phillip Rogaway:
Improved Security Analyses for CBC MACs. CRYPTO 2005: 527-545 - Alexandra Boldyreva, Marc Fischlin:
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes. CRYPTO 2005: 412-429 - Dan Boneh, Craig Gentry, Brent Waters:
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys. CRYPTO 2005: 258-275 - Jan Camenisch, Anna Lysyanskaya:
A Formal Treatment of Onion Routing. CRYPTO 2005: 169-187 - Benoît Chevallier-Mames:
An Efficient CDH-Based Signature Scheme with a Tight Security Reduction. CRYPTO 2005: 511-526 - Jean-Sébastien Coron, Yevgeniy Dodis, Cécile Malinaud, Prashant Puniya:
Merkle-Damgård Revisited: How to Construct a Hash Function. CRYPTO 2005: 430-448 - Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander
, Jaume Martí-Farré, Carles Padró:
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. CRYPTO 2005: 327-343 - Ronald Cramer, Serge Fehr, Martijn Stam:
Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields. CRYPTO 2005: 344-360 - Ivan Damgård, Yuval Ishai:
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. CRYPTO 2005: 378-394 - Ivan Damgård, Thomas Brochmann Pedersen, Louis Salvail:
A Quantum Cipher with Near Optimal Key-Recycling. CRYPTO 2005: 494-510 - Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrzak:
On the Generic Insecurity of the Full Domain Hash. CRYPTO 2005: 449-466 - Cynthia Dwork, Moni Naor, Hoeteck Wee:
Pebbling and Proofs of Work. CRYPTO 2005: 37-54 - Marc Fischlin:
Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors. CRYPTO 2005: 152-168 - Robert Granger
, Frederik Vercauteren:
On the Discrete Logarithm Problem on Algebraic Tori. CRYPTO 2005: 66-85 - Thomas Holenstein, Renato Renner:
One-Way Secret-Key Agreement and Applications to Circuit Polarization and Immunization of Public-Key Encryption. CRYPTO 2005: 478-493 - Jung Yeon Hwang, Dong Hoon Lee, Jongin Lim:
Generic Transformation for Scalable Broadcast Encryption Schemes. CRYPTO 2005: 276-292 - Ari Juels, Stephen A. Weis:
Authenticating Pervasive Devices with Human Protocols. CRYPTO 2005: 293-308 - Lea Kissner, Dawn Xiaodong Song:
Privacy-Preserving Set Operations. CRYPTO 2005: 241-257 - Hugo Krawczyk:
HMQV: A High-Performance Secure Diffie-Hellman Protocol. CRYPTO 2005: 546-566 - Yi Lu, Willi Meier, Serge Vaudenay:
The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption. CRYPTO 2005: 97-117 - Alexei G. Myasnikov, Vladimir Shpilrain, Alexander Ushakov:
A Practical Attack on a Braid Group Based Cryptographic Protocol. CRYPTO 2005: 86-96 - Rafail Ostrovsky, William E. Skeith III:
Private Searching on Streaming Data. CRYPTO 2005: 223-240 - Rafael Pass, Abhi Shelat:
Unconditional Characterizations of Non-interactive Zero-Knowledge. CRYPTO 2005: 118-134 - Kun Peng, Colin Boyd, Ed Dawson:
Simple and Efficient Shuffling with Provable Correctness and ZK Privacy. CRYPTO 2005: 188-204 - Krzysztof Pietrzak:
Composition Does Not Imply Adaptive Security. CRYPTO 2005: 55-65 - Serge Vaudenay:
Secure Communications over Insecure Channels Based on Short Authenticated Strings. CRYPTO 2005: 309-326
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.
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.
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.
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-06-20 11:10 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
