![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 31 matches
- 2014
- Takahiro Matsuda, Goichiro Hanaoka:
Chosen Ciphertext Security via Point Obfuscation. TCC 2014: 95-120 - Masayuki Abe, Jan Camenisch, Rafael Dowsley
, Maria Dubovitskaya:
On the Impossibility of Structure-Preserving Deterministic Primitives. TCC 2014: 713-738 - Masayuki Abe, Jens Groth
, Miyako Ohkubo, Mehdi Tibouchi
:
Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures. TCC 2014: 688-712 - Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. TCC 2014: 663-687 - Gilad Asharov
:
Towards Characterizing Complete Fairness in Secure Two-Party Computation. TCC 2014: 291-316 - Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Obfuscation for Evasive Functions. TCC 2014: 26-51 - Amos Beimel
, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin
:
Multi-linear Secret-Sharing Schemes. TCC 2014: 394-418 - Amos Beimel
, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz:
On the Cryptographic Complexity of the Worst Functions. TCC 2014: 317-342 - Alexandra Berkoff, Feng-Hao Liu:
Leakage Resilient Fully Homomorphic Encryption. TCC 2014: 515-539 - Elette Boyle, Kai-Min Chung, Rafael Pass
:
On Extractability Obfuscation. TCC 2014: 52-73 - Zvika Brakerski, Guy N. Rothblum:
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. TCC 2014: 1-25 - Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostrovsky:
Locally Updatable and Locally Decodable Codes. TCC 2014: 489-514 - Mahdi Cheraghchi
, Venkatesan Guruswami:
Non-malleable Coding against Bit-Wise and Split-State Tampering. TCC 2014: 440-464 - Seung Geol Choi, Jonathan Katz, Dominique Schröder
, Arkady Yerukhimovich, Hong-Sheng Zhou
:
(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens. TCC 2014: 638-662 - Kai-Min Chung, Rafail Ostrovsky, Rafael Pass
, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti:
4-Round Resettably-Sound Zero Knowledge. TCC 2014: 192-216 - Dana Dachman-Soled, Yael Tauman Kalai:
Securing Circuits and Protocols against 1/poly(k) Tampering Rate. TCC 2014: 540-565 - Dana Dachman-Soled, Mohammad Mahmoody
, Tal Malkin:
Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? TCC 2014: 217-239 - Sebastian Faust, Pratyay Mukherjee, Jesper Buus Nielsen
, Daniele Venturi
:
Continuous Non-malleable Codes. TCC 2014: 465-488 - Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova:
Two-Round Secure MPC from Indistinguishability Obfuscation. TCC 2014: 74-94 - Carmit Hazay
, Arpita Patra:
One-Sided Adaptively Secure Two-Party Computation. TCC 2014: 368-393 - Martin Hirt, Ueli Maurer, Pavel Raykov:
Broadcast Amplification. TCC 2014: 419-439 - Dennis Hofheinz, Andy Rupp:
Standard versus Selective Opening Security: Separation and Equivalence Results. TCC 2014: 591-615 - Yuval Ishai, Mor Weiss:
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge. TCC 2014: 121-145 - Dimitar Jetchev, Krzysztof Pietrzak:
How to Fake Auxiliary Input. TCC 2014: 566-590 - Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto:
Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol. TCC 2014: 343-367 - Mohammad Mahmoody
, Hemanta K. Maji, Manoj Prabhakaran:
On the Power of Public-Key Encryption in Secure Computation. TCC 2014: 240-264 - Takahiro Matsuda:
On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations. TCC 2014: 265-290 - Claudio Orlandi
, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti:
Statistical Concurrent Non-malleable Zero Knowledge. TCC 2014: 167-191 - Omkant Pandey:
Achieving Constant Round Leakage-Resilient Zero-Knowledge. TCC 2014: 146-166 - Hoeteck Wee:
Dual System Encryption via Predicate Encodings. TCC 2014: 616-637
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-25 05:03 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