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
- 2007
- Ross J. Anderson, Tyler Moore:
Information Security Economics - and Beyond. CRYPTO 2007: 68-91 - Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Cryptography with Constant Input Locality. CRYPTO 2007: 92-110 - Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49 - Mihir Bellare, Alexandra Boldyreva, Adam O'Neill:
Deterministic and Efficiently Searchable Encryption. CRYPTO 2007: 535-552 - Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III:
Public Key Encryption That Allows PIR Queries. CRYPTO 2007: 50-67 - Emmanuel Bresson, Yassine Lakhnech, Laurent Mazaré, Bogdan Warinschi:
A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness. CRYPTO 2007: 482-499 - Daniel R. L. Brown, Kristian Gjøsteen:
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. CRYPTO 2007: 466-481 - Ran Canetti, Ronald L. Rivest, Madhu Sudan, Luca Trevisan, Salil P. Vadhan, Hoeteck Wee:
Amplifying Collision Resistance: A Complexity-Theoretic Treatment. CRYPTO 2007: 264-283 - Melissa Chase, Anna Lysyanskaya:
Simulatable VRFs with Applications to Multi-theorem NIZK. CRYPTO 2007: 303-322 - Jean-Sébastien Coron:
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach. CRYPTO 2007: 379-394 - Ronald Cramer, Eike Kiltz, Carles Padró:
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. CRYPTO 2007: 613-630 - Ivan Damgård, Serge Fehr, Renato Renner, Louis Salvail, Christian Schaffner:
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. CRYPTO 2007: 360-378 - Ivan Damgård, Serge Fehr, Louis Salvail, Christian Schaffner:
Secure Identification and QKD in the Bounded-Quantum-Storage Model. CRYPTO 2007: 342-359 - Ivan Damgård, Jesper Buus Nielsen:
Scalable and Unconditionally Secure Multiparty Computation. CRYPTO 2007: 572-590 - Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld, Huaxiong Wang:
On Secure Multi-party Computation in Black-Box Groups. CRYPTO 2007: 591-612 - Vivien Dubois, Pierre-Alain Fouque, Adi Shamir, Jacques Stern:
Practical Cryptanalysis of SFLASH. CRYPTO 2007: 1-12 - Marc Fischlin, Anja Lehmann:
Security-Amplifying Combiners for Collision-Resistant Hash Functions. CRYPTO 2007: 224-243 - Pierre-Alain Fouque, Gaëtan Leurent, Phong Q. Nguyen:
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5. CRYPTO 2007: 13-30 - Vipul Goyal:
Reducing Trust in the PKG in Identity Based Cryptosystems. CRYPTO 2007: 430-447 - Jens Groth, Rafail Ostrovsky:
Cryptography in the Multi-string Model. CRYPTO 2007: 323-341 - Shai Halevi:
Invertible Universal Hashing and the TET Encryption Mode. CRYPTO 2007: 412-429 - Guillaume Hanrot, Damien Stehlé:
Improved Analysis of Kannan's Shortest Lattice Vector Algorithm. CRYPTO 2007: 170-186 - Danny Harnik, Yuval Ishai, Eyal Kushilevitz:
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? CRYPTO 2007: 284-302 - Dennis Hofheinz, Eike Kiltz:
Secure Hybrid Encryption from Weakened Key Encapsulation. CRYPTO 2007: 553-571 - Omer Horvitz, Jonathan Katz:
Universally-Composable Two-Party Computation in Two Rounds. CRYPTO 2007: 111-129 - Nick Howgrave-Graham:
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU. CRYPTO 2007: 150-169 - Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Chernoff-Type Direct Product Theorems. CRYPTO 2007: 500-516 - Ellen Jochemsz, Alexander May:
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073. CRYPTO 2007: 395-411 - Antoine Joux, Thomas Peyrin:
Hash Functions and the (Amplified) Boomerang Attack. CRYPTO 2007: 244-263 - Aggelos Kiayias, Serdar Pehlivanoglu:
Pirate Evolution: How to Make the Most of Your Traitor Keys. CRYPTO 2007: 448-465
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-10-12 16:00 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