Остановите войну!
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 28 matches
- 2022
- Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran:
SCALES - MPC with Small Clients and Larger Ephemeral Servers. TCC (2) 2022: 502-531 - Thomas Agrikola, Geoffroy Couteau, Sven Maier:
Anonymous Whistleblowing over Authenticated Channels. TCC (2) 2022: 685-714 - Adi Akavia, Craig Gentry, Shai Halevi, Margarita Vald:
Achievable CCA2 Relaxation for Homomorphic Encryption. TCC (2) 2022: 70-99 - Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. TCC (2) 2022: 532-561 - Megumi Ando, Miranda Christ, Anna Lysyanskaya, Tal Malkin:
Poly Onions: Achieving Anonymity in the Presence of Churn. TCC (2) 2022: 715-746 - Benny Applebaum, Eliran Kachlon, Arpita Patra:
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). TCC (2) 2022: 103-120 - Saikrishna Badrinarayanan, Sikhar Patranabis, Pratik Sarkar:
Statistical Security in Two-Party Computation Revisited. TCC (2) 2022: 181-210 - Kaartik Bhushan, Ankit Kumar Misra, Varun Narayanan, Manoj Prabhakaran:
Secure Non-interactive Reducibility is Decidable. TCC (2) 2022: 408-437 - Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler:
On the Worst-Case Inefficiency of CGKA. TCC (2) 2022: 213-243 - Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) 2022: 593-622 - Andrej Bogdanov, Miguel Cueto Noval, Charlotte Hoffmann, Alon Rosen:
Public-Key Encryption from Homogeneous CLWE. TCC (2) 2022: 565-592 - Elette Boyle, Geoffroy Couteau, Pierre Meyer:
Sublinear Secure Computation from New Assumptions. TCC (2) 2022: 121-150 - Pedro Branco, Nico Döttling, Jesko Dujmovic:
Rate-1 Incompressible Encryption from Standard Assumptions. TCC (2) 2022: 33-69 - Nicholas Brandt, Dennis Hofheinz, Julia Kastner, Akin Ünal:
The Price of Verifiability: Lower Bounds for Verifiable Random Functions. TCC (2) 2022: 747-776 - Dario Catalano, Dario Fiore, Rosario Gennaro, Emanuele Giunta:
On the Impossibility of Algebraic Vector Commitments in Pairing-Free Groups. TCC (2) 2022: 274-299 - Seung Geol Choi, Dana Dachman-Soled, S. Dov Gordon, Linsheng Liu, Arkady Yerukhimovich:
Secure Sampling with Sublinear Communication. TCC (2) 2022: 348-377 - Michele Ciampi, Emmanuela Orsini, Luisa Siniscalchi:
Four-Round Black-Box Non-malleable Schemes from One-Way Permutations. TCC (2) 2022: 300-329 - Yevgeniy Dodis, Daniel Jost, Harish Karthikeyan:
Forward-Secure Encryption with Fast Forwarding. TCC (2) 2022: 3-32 - Cody Freitag, Rafael Pass, Naomi Sirkin:
Parallelizable Delegation from LWE. TCC (2) 2022: 623-652 - Nathan Geier:
A Tight Computational Indistinguishability Bound for Product Distributions. TCC (2) 2022: 333-347 - Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. TCC (2) 2022: 441-469 - Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. TCC (2) 2022: 470-501 - Hamidreza Amini Khorasgani, Hemanta K. Maji, Hai H. Nguyen:
Secure Non-interactive Simulation from Arbitrary Joint Distributions. TCC (2) 2022: 378-407 - Venkata Koppula, Brent Waters, Mark Zhandry:
Adaptive Multiparty NIKE. TCC (2) 2022: 244-273 - George Lu, Brent Waters:
How to Sample a Discrete Gaussian (and more) from a Random Oracle. TCC (2) 2022: 653-682 - Ian McQuoid, Mike Rosulek, Jiayu Xu:
How to Obfuscate MPC Inputs. TCC (2) 2022: 151-180 - Moni Naor, Noa Oved:
Bet-or-Pass: Adversarially Robust Bloom Filters. TCC (2) 2022: 777-808 - Eike Kiltz, Vinod Vaikuntanathan:
Theory of Cryptography - 20th International Conference, TCC 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part II. Lecture Notes in Computer Science 13748, Springer 2022, ISBN 978-3-031-22364-8 [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-07-03 04:14 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