On the Cryptographic Complexity of the Worst Functions
Amos Beimel,Yuval Ishai,Ranjit Kumaresan,Eyal Kushilevitz +3 more
- Vol. 8349, pp 317-342
Reads0
Chats0
TLDR
The complexity of realizing the “worst” functions in several standard models of information-theoretic cryptography, for the case of security against passive adversaries, is studied.Abstract:
We study the complexity of realizing the “worst” functions in several standard models of information-theoretic cryptography. In particular, for the case of security against passive adversaries, we obtain the following main results.read more
Citations
More filters
Book
Advances in cryptology : Eurocrypt 2011 : 30th annual international conference on the theory and applications of cryptographic techniques, Tallinn, Estonia, May 15-19, 2011 : proceedings
TL;DR: This book constitutes the refereed proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2011, held in Tallinn, Estonia, in May 2011, and contains 31 papers, presented together with 2 invited talks.
Journal ArticleDOI
Converses For Secret Key Agreement and Secure Computing
Himanshu Tyagi,Shun Watanabe +1 more
TL;DR: In this paper, the authors considered information theoretic secret key (SK) agreement and secure function computation by multiple parties observing correlated data, with access to an interactive public communication channel.
Book ChapterDOI
Conditional Disclosure of Secrets via Non-linear Reconstruction
TL;DR: New protocols for conditional disclosure of secrets (CDS), where two parties want to disclose a secret to a third party if and only if their respective inputs satisfy some predicate, are presented.
Book ChapterDOI
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
TL;DR: A general upper bound and the first non-trivial lower bounds for conditional disclosure of secrets are presented, which explain the trade-off between ciphertext and secret key sizes of several existing attribute-based encryption schemes based on the dual system methodology.
Book ChapterDOI
Garbled Circuits as Randomized Encodings of Functions: a Primer
TL;DR: This tutorial studies garbled circuits from a foundational point of view under the framework of randomized encoding (RE) of functions to review old and new constructions of REs, present some lower bounds, and describe some applications.
References
More filters
Proceedings ArticleDOI
How to play ANY mental game
TL;DR: This work presents a polynomial-time algorithm that, given as a input the description of a game with incomplete information and any number of players, produces a protocol for playing the game that leaks no partial information, provided the majority of the players is honest.
Proceedings Article
How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or Idistributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machimery.
Proceedings Article
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)
TL;DR: The above bounds on t , where t is the number of players in actors, are tight!
Proceedings ArticleDOI
Completeness theorems for non-cryptographic fault-tolerant distributed computation
TL;DR: In this article, the authors show that every function of n inputs can be efficiently computed by a complete network of n processors in such a way that if no faults occur, no set of size t can be found.