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 36 matches
- 2010
- Michel Abdalla, Mihir Bellare, Gregory Neven:
Robust Encryption. TCC 2010: 480-497 - Endre Bangerter, Jan Camenisch, Stephan Krenn:
Efficiency Limitations for Σ-Protocols for Group Homomorphisms. TCC 2010: 553-571 - Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim:
Bounds on the Sample Complexity for Private Learning and Private Data Release. TCC 2010: 437-454 - Rikke Bendlin, Ivan Damgård:
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. TCC 2010: 201-218 - Eleanor Birrell, Salil P. Vadhan:
Composition of Zero-Knowledge Proofs with Efficient Provers. TCC 2010: 572-587 - Jan Camenisch:
Privacy-Enhancing Cryptography: From Theory into Practice. TCC 2010: 498 - Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. TCC 2010: 52-71 - Ran Canetti, Guy N. Rothblum, Mayank Varia:
Obfuscation of Hyperplane Membership. TCC 2010: 72-89 - Kai-Min Chung, Feng-Hao Liu:
Parallel Repetition Theorems for Interactive Arguments. TCC 2010: 19-36 - Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin:
A Domain Extender for the Ideal Cipher. TCC 2010: 273-289 - Ronald Cramer, Dennis Hofheinz, Eike Kiltz:
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. TCC 2010: 146-164 - Ivan Damgård, Martin Geisler, Jesper Buus Nielsen:
From Passive to Covert Security at Low Cost. TCC 2010: 128-145 - Ivan Damgård, Gert Læssøe Mikkelsen:
Efficient, Robust and Constant-Round Distributed RSA Key Generation. TCC 2010: 183-200 - Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi:
On the Necessary and Sufficient Assumptions for UC Computation. TCC 2010: 109-127 - Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Public-Key Encryption Schemes with Auxiliary Inputs. TCC 2010: 361-381 - Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. TCC 2010: 219-236 - Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum:
Leakage-Resilient Signatures. TCC 2010: 343-360 - Marc Fischlin, Anja Lehmann:
Delayed-Key Message Authentication for Streams. TCC 2010: 290-307 - Georg Fuchsbauer, Jonathan Katz, David Naccache:
Efficient Rational Secret Sharing in Standard Communication Networks. TCC 2010: 419-436 - David Goldenberg, Moses D. Liskov:
On Related-Secret Pseudorandomness. TCC 2010: 255-272 - S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai:
On Complete Primitives for Fairness. TCC 2010: 91-108 - Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia:
Founding Cryptography on Tamper-Proof Hardware Tokens. TCC 2010: 308-326 - Ronen Gradwohl:
Rationality in the Full-Information Model. TCC 2010: 401-418 - Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak:
An Efficient Parallel Repetition Theorem. TCC 2010: 1-18 - Yuval Ishai:
Secure Computation and Its Diverse Applications. TCC 2010: 90 - Charanjit S. Jutla:
Almost Optimal Bounds for Direct Product Threshold Theorem. TCC 2010: 37-51 - Vladimir Kolesnikov:
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens. TCC 2010: 327-342 - Allison B. Lewko, Brent Waters:
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts. TCC 2010: 455-479 - Benoît Libert, Moti Yung:
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs. TCC 2010: 499-517 - Vadim Lyubashevsky, Adriana Palacio, Gil Segev:
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. TCC 2010: 382-400
skipping 6 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-11 03:02 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