Остановите войну!
for scientists:
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
- 2009
- Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan:
Simultaneous Hardcore Bits and Cryptography against Memory Attacks. TCC 2009: 474-495 - Yair Amir, Paul Bunn, Rafail Ostrovsky:
Authenticated Adversarial Routing. TCC 2009: 163-182 - Amos Beimel, Ilan Orlov:
Secret Sharing and Non-Shannon Information Inequalities. TCC 2009: 539-557 - Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan:
Weak Verifiable Random Functions. TCC 2009: 558-576 - Ran Canetti, Ronny Ramzi Dakdouk:
Towards a Theory of Extractable Functions. TCC 2009: 595-613 - Ran Canetti, Mayank Varia:
Non-malleable Obfuscation. TCC 2009: 73-90 - Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Simple, Black-Box Constructions of Adaptively Secure Protocols. TCC 2009: 387-402 - James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. TCC 2009: 521-538 - Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
Universally Composable Multiparty Computation with Partially Isolated Parties. TCC 2009: 315-331 - Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Security Amplification for InteractiveCryptographic Primitives. TCC 2009: 128-145 - Yevgeniy Dodis, Jonathan Katz, Adam D. Smith, Shabsi Walfish:
Composability and On-Line Deniability of Authentication. TCC 2009: 146-162 - Yevgeniy Dodis, Salil P. Vadhan, Daniel Wichs:
Proofs of Retrievability via Hardness Amplification. TCC 2009: 109-127 - Cynthia Dwork:
The Differential Privacy Frontier (Extended Abstract). TCC 2009: 496-502 - Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan:
How Efficient Can Memory Checking Be?. TCC 2009: 503-520 - Serge Fehr, Christian Schaffner:
Composing Quantum Protocols in a Classical Environment. TCC 2009: 350-367 - Craig Gentry, Shai Halevi:
Hierarchical Identity Based Encryption with Polynomially Many Levels. TCC 2009: 437-456 - S. Dov Gordon, Jonathan Katz:
Complete Fairness in Multi-party Computation without an Honest Majority. TCC 2009: 19-35 - Iftach Haitner, Thomas Holenstein:
On the (Im)Possibility of Key Dependent Encryption. TCC 2009: 202-219 - Iftach Haitner, Alon Rosen, Ronen Shaltiel:
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237 - Yuval Ishai, Manoj Prabhakaran, Amit Sahai:
Secure Arithmetic Computation with No Honest Majority. TCC 2009: 294-314 - Stanislaw Jarecki, Xiaomin Liu:
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection. TCC 2009: 577-594 - Robin Künzler, Jörn Müller-Quade, Dominik Raub:
Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. TCC 2009: 238-255 - Yehuda Lindell, Hila Zarosim:
Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer. TCC 2009: 183-201 - Hemanta K. Maji, Manoj Prabhakaran, Mike Rosulek:
Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation. TCC 2009: 256-273 - Silvio Micali, Abhi Shelat:
Purely Rational Secret Sharing (Extended Abstract). TCC 2009: 54-71 - Tal Moran, Moni Naor, Gil Segev:
An Optimally Fair Coin Toss. TCC 2009: 1-18 - Jesper Buus Nielsen, Claudio Orlandi:
LEGO for Two-Party Secure Computation. TCC 2009: 368-386 - Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. TCC 2009: 36-53 - Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Simulation-Based Concurrent Non-malleable Commitments and Decommitments. TCC 2009: 91-108 - Rafael Pass, Hoeteck Wee:
Black-Box Constructions of Two-Party Protocols from One-Way Functions. TCC 2009: 403-418
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-05-29 19:43 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