Остановите войну!
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 27 matches
- 2015
- Takahiro Matsuda, Goichiro Hanaoka:
Constructing and Understanding Chosen Ciphertext Security via Puncturable Key Encapsulation Mechanisms. TCC (1) 2015: 561-590 - Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski:
Leakage-Resilient Non-malleable Codes. TCC (1) 2015: 398-426 - Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran:
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations. TCC (1) 2015: 375-397 - Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri:
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. TCC (1) 2015: 199-228 - Christoph Bader, Dennis Hofheinz, Tibor Jager, Eike Kiltz, Yong Li:
Tightly-Secure Authenticated Key Exchange. TCC (1) 2015: 629-658 - Andrej Bogdanov, Christina Brzuska:
On Basing Size-Verifiable One-Way Functions on NP-Hardness. TCC (1) 2015: 1-6 - Kai-Min Chung, Edward Lui, Rafael Pass:
From Weak to Strong Zero-Knowledge and Applications. TCC (1) 2015: 66-92 - Sandro Coretti, Ueli Maurer, Björn Tackmann, Daniele Venturi:
From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes. TCC (1) 2015: 532-560 - Ronald Cramer, Carles Padró, Chaoping Xing:
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. TCC (1) 2015: 481-501 - Dana Dachman-Soled, Feng-Hao Liu, Elaine Shi, Hong-Sheng Zhou:
Locally Decodable and Updatable Non-malleable Codes and Their Applications. TCC (1) 2015: 427-450 - Nico Döttling, Daniel Kraschewski, Jörn Müller-Quade, Tobias Nilges:
General Statistically Secure Computation with Bounded-Resettable Hardware Tokens. TCC (1) 2015: 319-344 - Ben A. Fisch, Daniel Freund, Moni Naor:
Secure Physical Computation Using Disposable Circuits. TCC (1) 2015: 182-198 - Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, Moti Yung:
A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation. TCC (1) 2015: 134-158 - Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai:
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma. TCC (1) 2015: 260-289 - Chun Guo, Dongdai Lin:
On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation. TCC (1) 2015: 110-133 - Siyao Guo, Tal Malkin, Igor C. Oliveira, Alon Rosen:
The Power of Negations in Cryptography. TCC (1) 2015: 36-65 - Brett Hemenway, Rafail Ostrovsky, Alon Rosen:
Non-committing Encryption from Φ-hiding. TCC (1) 2015: 591-608 - Zahra Jafargholi, Daniel Wichs:
Tamper Detection and Continuous Non-malleable Codes. TCC (1) 2015: 451-480 - Susumu Kiyoshima:
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting. TCC (1) 2015: 290-318 - Vladimir Kolesnikov, Payman Mohassel, Ben Riva, Mike Rosulek:
Richer Efficiency/Security Trade-offs in 2PC. TCC (1) 2015: 229-259 - Xin Li:
Non-malleable Condensers for Arbitrary Min-entropy, and Almost Optimal Protocols for Privacy Amplification. TCC (1) 2015: 502-531 - Yehuda Lindell:
An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle. TCC (1) 2015: 93-109 - Tal Moran, Ilan Orlov, Silas Richelson:
Topology-Hiding Computation. TCC (1) 2015: 159-181 - Rafail Ostrovsky, Alessandra Scafuro, Muthuramakrishnan Venkitasubramaniam:
Resettably Sound Zero-Knowledge Arguments from OWFs - The (Semi) Black-Box Way. TCC (1) 2015: 345-374 - Adam D. Smith, Ye Zhang:
On the Regularity of Lossy RSA - Improved Bounds and Applications to Padding-Based Encryption. TCC (1) 2015: 609-628 - Yu Yu, Dawu Gu, Xiangxue Li, Jian Weng:
The Randomized Iterate, Revisited - Almost Linear Seed Length PRGs from a Broader Class of One-Way Functions. TCC (1) 2015: 7-35 - Yevgeniy Dodis, Jesper Buus Nielsen:
Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I. Lecture Notes in Computer Science 9014, Springer 2015, ISBN 978-3-662-46493-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-26 19:34 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