Остановите войну!
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 26 matches
- 2016
- Bar Alon, Eran Omri:
Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious. TCC (B1) 2016: 307-335 - Benny Applebaum, Pavel Raykov:
Fast Pseudorandom Functions Based on Expander Graphs. TCC (B1) 2016: 27-56 - Carsten Baum, Emmanuela Orsini, Peter Scholl:
Efficient Secure Multiparty Computation with Identifiable Abort. TCC (B1) 2016: 461-490 - Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai, Omer Paneth, Vinod Vaikuntanathan:
3-Message Zero Knowledge Against Human Ignorance. TCC (B1) 2016: 57-83 - Mark Bun, Yi-Hsiu Chen, Salil P. Vadhan:
Separating Computational and Statistical Differential Privacy in the Client-Server Model. TCC (B1) 2016: 607-634 - Mark Bun, Thomas Steinke:
Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds. TCC (B1) 2016: 635-658 - Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci:
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. TCC (B1) 2016: 204-234 - Aloni Cohen, Saleet Klein:
The GGM Function Family Is a Weakly One-Way Family of Functions. TCC (B1) 2016: 84-107 - Dario Fiore, Anca Nitulescu:
On the (In)Security of SNARKs in the Presence of Oracles. TCC (B1) 2016: 108-138 - Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey:
Secure Multiparty RAM Computation in Constant Rounds. TCC (B1) 2016: 491-520 - Daniel Genkin, Yuval Ishai, Mor Weiss:
Binary AMD Circuits from Secure Multiparty Computation. TCC (B1) 2016: 336-366 - Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity. TCC (B1) 2016: 367-399 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions. TCC (B1) 2016: 400-432 - Carmit Hazay, Avishay Yanai:
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model. TCC (B1) 2016: 521-553 - Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) 2016: 235-261 - Zahra Jafargholi, Daniel Wichs:
Adaptive Security of Yao's Garbled Circuits. TCC (B1) 2016: 433-458 - Ilan Komargodski:
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. TCC (B1) 2016: 139-158 - Lucas Kowalczyk, Tal Malkin, Jonathan R. Ullman, Mark Zhandry:
Strong Hardness of Privacy from Weak Traitor Tracing. TCC (B1) 2016: 659-689 - Yehuda Lindell, Nigel P. Smart, Eduardo Soria-Vazquez:
More Efficient Constant-Round Multi-party Computation from BMR and SHE. TCC (B1) 2016: 554-581 - Ueli Maurer, Renato Renner:
From Indifferentiability to Constructive Cryptography (and Back). TCC (B1) 2016: 3-24 - Jesper Buus Nielsen, Claudio Orlandi:
Cross and Clean: Amortized Garbled Circuits with Constant Overhead. TCC (B1) 2016: 582-603 - Krzysztof Pietrzak, Maciej Skórski:
Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. TCC (B1) 2016: 183-203 - Ling Ren, Srinivas Devadas:
Proof of Space from Stacked Expanders. TCC (B1) 2016: 262-285 - Maciej Skórski:
Simulating Auxiliary Inputs, Revisited. TCC (B1) 2016: 159-179 - Gabriele Spini, Gilles Zémor:
Perfectly Secure Message Transmission in Two Rounds. TCC (B1) 2016: 286-304 - Martin Hirt, Adam D. Smith:
Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9985, 2016, ISBN 978-3-662-53640-7 [contents]
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-22 14:07 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