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 40 matches
- 2010
- Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, Miyako Ohkubo:
Structure-Preserving Signatures and Commitments to Group Elements. CRYPTO 2010: 209-236 - Shweta Agrawal, Dan Boneh, Xavier Boyen:
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE. CRYPTO 2010: 98-115 - Amos Beimel, Eran Omri, Ilan Orlov:
Protocols for Multiparty Coin Toss with Dishonest Majority. CRYPTO 2010: 538-557 - Mihir Bellare, David Cash:
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks. CRYPTO 2010: 666-684 - Nir Bitansky, Ran Canetti:
On Strong Simulation and Composable Point Obfuscation. CRYPTO 2010: 520-537 - Niek J. Bouman, Serge Fehr:
Sampling in a Quantum Population, and Applications. CRYPTO 2010: 724-741 - Zvika Brakerski, Shafi Goldwasser:
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back). CRYPTO 2010: 1-20 - Eric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriam, Mehdi Tibouchi:
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. CRYPTO 2010: 237-254 - Jan Camenisch, Nathalie Casati, Thomas Gross, Victor Shoup:
Credential Authenticated Identification and Key Exchange. CRYPTO 2010: 255-276 - Chongwon Cho, Chen-Kuei Lee, Rafail Ostrovsky:
Equivalence of Uniform Key Agreement and Composition Insecurity. CRYPTO 2010: 447-464 - Kai-Min Chung, Yael Tauman Kalai, Salil P. Vadhan:
Improved Delegation of Computation Using Fully Homomorphic Encryption. CRYPTO 2010: 483-501 - Ivan Damgård, Claudio Orlandi:
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost. CRYPTO 2010: 558-576 - Anindya De, Luca Trevisan, Madhur Tulsiani:
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs. CRYPTO 2010: 649-665 - Yevgeniy Dodis, Krzysztof Pietrzak:
Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks. CRYPTO 2010: 21-40 - Orr Dunkelman, Nathan Keller, Adi Shamir:
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony. CRYPTO 2010: 393-410 - Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail:
Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries. CRYPTO 2010: 685-706 - Rosario Gennaro, Craig Gentry, Bryan Parno:
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. CRYPTO 2010: 465-482 - Craig Gentry:
Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness. CRYPTO 2010: 116-137 - Craig Gentry, Shai Halevi, Vinod Vaikuntanathan:
i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits. CRYPTO 2010: 155-172 - Shafi Goldwasser, Guy N. Rothblum:
Securing Computation against Continuous Leakage. CRYPTO 2010: 59-79 - Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit Sahai:
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography. CRYPTO 2010: 173-190 - Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Password-Authenticated Session-Key Generation on the Internet in the Plain Model. CRYPTO 2010: 277-294 - Wilko Henecka, Alexander May, Alexander Meurer:
Correcting Errors in RSA Private Keys. CRYPTO 2010: 351-369 - Viet Tung Hoang, Phillip Rogaway:
On Generalized Feistel Networks. CRYPTO 2010: 613-630 - Yuval Ishai, Eyal Kushilevitz, Anat Paskin:
Secure Multiparty Computation with Minimal Interaction. CRYPTO 2010: 577-594 - Ali Juma, Yevgeniy Vahlis:
Protecting Cryptographic Keys against Continual Leakage. CRYPTO 2010: 41-58 - Eike Kiltz, Adam O'Neill, Adam D. Smith:
Instantiability of RSA-OAEP under Chosen-Plaintext Attack. CRYPTO 2010: 295-313 - Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman J. J. te Riele, Andrey Timofeev, Paul Zimmermann:
Factorization of a 768-Bit RSA Modulus. CRYPTO 2010: 333-350 - Hugo Krawczyk:
Cryptographic Extraction and Key Derivation: The HKDF Scheme. CRYPTO 2010: 631-648 - Huijia Lin, Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Concurrent Non-Malleable Zero Knowledge Proofs. CRYPTO 2010: 429-446
skipping 10 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-13 10:01 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