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
- 2008
- Ittai Abraham, Danny Dolev, Joseph Y. Halpern:
Lower Bounds on Implementing Robust and Resilient Mediators. TCC 2008: 302-319 - Zuzana Beerliová-Trubíniová, Matthias Fitzi, Martin Hirt, Ueli M. Maurer, Vassilis Zikas:
MPC vs. SFE: Perfect Security in a Unified Corruption Model. TCC 2008: 231-250 - Zuzana Beerliová-Trubíniová, Martin Hirt:
Perfectly-Secure MPC with Linear Communication Complexity. TCC 2008: 213-230 - Amos Beimel, Noam Livne, Carles Padró:
Matroids Can Be Far from Ideal Secret Sharing. TCC 2008: 194-212 - Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya:
P-signatures and Noninteractive Anonymous Credentials. TCC 2008: 356-374 - Eli Biham, Yaron J. Goren, Yuval Ishai:
Basing Weak Public-Key Cryptography on Strong One-Way Functions. TCC 2008: 55-72 - André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan:
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. TCC 2008: 501-534 - Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One. TCC 2008: 427-444 - Nenad Dedic, Danny Harnik, Leonid Reyzin:
Saving Private Randomness in One-Way Functions and Pseudorandom Generators. TCC 2008: 607-625 - Serge Fehr, Christian Schaffner:
Randomness Extraction Via delta -Biased Masking in the Presence of a Quantum Attacker. TCC 2008: 465-481 - Marc Fischlin, Anja Lehmann:
Multi-property Preserving Combiners for Hash Functions. TCC 2008: 375-392 - Rosario Gennaro:
Faster and Shorter Password-Authenticated Key Exchange. TCC 2008: 589-606 - Vipul Goyal, Jonathan Katz:
Universally Composable Multi-party Computation with an Unreliable Common Reference String. TCC 2008: 142-154 - Iftach Haitner:
Semi-honest to Malicious Oblivious Transfer - The Black-Box Way. TCC 2008: 412-426 - Iftach Haitner, Jonathan J. Hoch, Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. TCC 2008: 445-464 - Shai Halevi, Steven A. Myers, Charles Rackoff:
On Seed-Incompressible Functions. TCC 2008: 19-36 - Shai Halevi, Tal Rabin:
Degradation and Amplification of Computational Hardness. TCC 2008: 626-643 - Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen:
OT-Combiners via Secure Computation. TCC 2008: 393-411 - Carmit Hazay, Yehuda Lindell:
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. TCC 2008: 155-175 - Amir Herzberg, Igal Yoffe:
The Layered Games Framework for Specifications and Analysis of Security Protocols. TCC 2008: 125-141 - Sergei Izmalkov, Matt Lepinski, Silvio Micali:
Verifiably Secure Devices. TCC 2008: 273-301 - Jonathan Katz:
Which Languages Have 4-Round Zero-Knowledge Proofs? TCC 2008: 73-88 - Jonathan Katz:
Bridging Game Theory and Cryptography: Recent Results and Future Directions. TCC 2008: 251-272 - Aggelos Kiayias, Hong-Sheng Zhou:
Equivocal Blind Signatures and Adaptive UC-Security. TCC 2008: 340-355 - Joe Kilian, André Madeira, Martin J. Strauss, Xuan Zheng:
Fast Private Norm Estimation and Heavy Hitters. TCC 2008: 176-193 - Hirotada Kobayashi:
General Properties of Quantum Zero-Knowledge Proofs. TCC 2008: 107-124 - Gillat Kol, Moni Naor:
Cryptography and Game Theory: Designing Protocols for Exchanging Information. TCC 2008: 320-339 - Huijia Lin, Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Concurrent Non-malleable Commitments from Any One-Way Function. TCC 2008: 571-588 - Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures. TCC 2008: 37-54 - Lior Malka:
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge. TCC 2008: 89-106
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-09-26 07:30 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