Остановите войну!
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
- 2018
- Shashank Agrawal, Venkata Koppula, Brent Waters:
Impossibility of Simulation Secure Functional Encryption Even with Random Oracles. TCC (1) 2018: 659-688 - Benny Applebaum, Barak Arkis:
On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. TCC (1) 2018: 317-344 - Benny Applebaum, Zvika Brakerski, Rotem Tsabary:
Perfect Secure Computation in Two Rounds. TCC (1) 2018: 152-174 - Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters:
Upgrading to Functional Encryption. TCC (1) 2018: 629-658 - Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam:
Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. TCC (1) 2018: 175-205 - Nir Bitansky, Huijia Lin:
One-Message Zero Knowledge and Non-malleable Commitments. TCC (1) 2018: 209-234 - Ran Canetti, Amit Lichtenberg:
Certifying Trapdoor Permutations, Revisited. TCC (1) 2018: 476-506 - Wutichai Chongchitmate, Rafail Ostrovsky:
Information-Theoretic Broadcast with Dishonest Majority for Long Messages. TCC (1) 2018: 370-388 - Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi:
Game Theoretic Notions of Fairness in Multi-party Coin Toss. TCC (1) 2018: 563-596 - Thaddeus Dryja, Quanquan C. Liu, Sunoo Park:
Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time. TCC (1) 2018: 33-66 - Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi:
Registration-Based Encryption: Removing Private-Key Generator from IBE. TCC (1) 2018: 689-718 - Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Two-Round MPC: Information-Theoretic and Black-Box. TCC (1) 2018: 123-151 - Iftach Haitner, Nikolaos Makriyannis, Eran Omri:
On the Complexity of Fair Coin Flipping. TCC (1) 2018: 539-562 - Mohammad Hajiabadi:
Enhancements are Blackbox Non-trivial: Impossibility of Enhanced Trapdoor Permutations from Standard Trapdoor Permutations. TCC (1) 2018: 448-475 - Carmit Hazay, Muthuramakrishnan Venkitasubramaniam:
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations. TCC (1) 2018: 263-285 - Daniel Jost, Ueli Maurer, João L. Ribeiro:
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. TCC (1) 2018: 345-369 - Charanjit S. Jutla, Arnab Roy:
Smooth NIZK Arguments. TCC (1) 2018: 235-262 - Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box "Commit-and-Prove". TCC (1) 2018: 286-313 - Susumu Kiyoshima:
No-signaling Linear PCPs. TCC (1) 2018: 67-97 - Tianren Liu:
On Basing Search SIVP on NP-Hardness. TCC (1) 2018: 98-119 - Andrew Morgan, Rafael Pass:
On the Security Loss of Unique Signatures. TCC (1) 2018: 507-536 - Andrew Morgan, Rafael Pass:
Achieving Fair Treatment in Algorithmic Classification. TCC (1) 2018: 597-625 - Varun Narayanan, Vinod M. Prabhakaran:
Oblivious Transfer in Incomplete Networks. TCC (1) 2018: 389-418 - Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? TCC (1) 2018: 421-447 - Stefano Tessaro, Aishwarya Thiruvengadam:
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries. TCC (1) 2018: 3-32 - Amos Beimel, Stefan Dziembowski:
Theory of Cryptography - 16th International Conference, TCC 2018, Panaji, India, November 11-14, 2018, Proceedings, Part I. Lecture Notes in Computer Science 11239, Springer 2018, ISBN 978-3-030-03806-9 [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-08 03:24 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