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 51 matches
- 2012
- Mohamed Ahmed Abdelraheem, Martin Ågren, Peter Beelen, Gregor Leander:
On the Distribution of Linear Biases: Three Instructive Examples. CRYPTO 2012: 50-67 - Shweta Agrawal, Vipul Goyal, Abhishek Jain, Manoj Prabhakaran, Amit Sahai:
New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation. CRYPTO 2012: 443-460 - Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas:
Collusion-Preserving Computation. CRYPTO 2012: 124-143 - Romain Bardou, Riccardo Focardi, Yusuke Kawamoto, Lorenzo Simionato, Graham Steel, Joe-Kai Tsay:
Efficient Padding Oracle Attacks on Cryptographic Hardware. CRYPTO 2012: 608-625 - Aslí Bay, Atefeh Mashatan, Serge Vaudenay:
Resistance against Iterated Attacks by Decorrelation Revisited, . CRYPTO 2012: 741-757 - Amos Beimel, Oriol Farràs, Yuval Mintz:
Secret Sharing Schemes for Very Dense Graphs. CRYPTO 2012: 144-161 - Mihir Bellare, Thomas Ristenpart, Stefano Tessaro:
Multi-instance Security and Its Application to Password-Based Cryptography. CRYPTO 2012: 312-329 - Mihir Bellare, Stefano Tessaro, Alexander Vardy:
Semantic Security for the Wiretap Channel. CRYPTO 2012: 294-311 - Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. CRYPTO 2012: 663-680 - Mario Berta, Omar Fawzi, Stephanie Wehner:
Quantum to Classical Randomness Extractors. CRYPTO 2012: 776-793 - Nir Bitansky, Alessandro Chiesa:
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. CRYPTO 2012: 255-272 - Zvika Brakerski:
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. CRYPTO 2012: 868-886 - Ernie Brickell:
Recent Advances and Existing Research Questions in Platform Security. CRYPTO 2012: 570 - Melissa Chase, Ivan Visconti:
Secure Database Commitments and Universal Arguments of Quasi Knowledge. CRYPTO 2012: 236-254 - Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits against Constant-Rate Tampering. CRYPTO 2012: 533-551 - Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias:
Multiparty Computation from Somewhat Homomorphic Encryption. CRYPTO 2012: 643-662 - Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir:
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. CRYPTO 2012: 719-740 - Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan:
Differential Privacy with Imperfect Randomness. CRYPTO 2012: 497-516 - Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro:
To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC. CRYPTO 2012: 348-366 - Alexandre Duc, Dimitar Jetchev:
Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves. CRYPTO 2012: 832-849 - Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail:
Actively Secure Two-Party Evaluation of Any Quantum Operation. CRYPTO 2012: 794-811 - Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti:
Impossibility Results for Static Input Secure Computation. CRYPTO 2012: 424-442 - Sanjam Garg, Amit Sahai:
Adaptively Secure Multi-Party Computation with Dishonest Majority. CRYPTO 2012: 105-123 - Johannes Gehrke, Michael Hay, Edward Lui, Rafael Pass:
Crowd-Blending Privacy. CRYPTO 2012: 479-496 - Craig Gentry, Shai Halevi, Nigel P. Smart:
Homomorphic Evaluation of the AES Circuit. CRYPTO 2012: 850-867 - Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee:
Functional Encryption with Bounded Collusions via Multi-party Computation. CRYPTO 2012: 162-179 - Goichiro Hanaoka, Takahiro Matsuda, Jacob C. N. Schuldt:
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups. CRYPTO 2012: 812-831 - Viet Tung Hoang, Ben Morris, Phillip Rogaway:
An Enciphering Scheme Based on a Card Shuffle. CRYPTO 2012: 1-13 - Dennis Hofheinz, Tibor Jager:
Tightly Secure Signatures and Public-Key Encryption. CRYPTO 2012: 590-607 - Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu:
Breaking and Repairing GCM Security Proofs. CRYPTO 2012: 31-49
skipping 21 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-21 12:36 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