Limits on the security of coin flips when half the processors are faulty
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A zero-one law for Boolean privacy
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A general completeness theorem for two party games
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Privacy and communication complexity
SIAM Journal on Discrete Mathematics
More general completeness theorems for secure two-party computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Unconditional Security Against Memory-Bounded Adversaries
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Multiparty Quantum Coin Flipping
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Statistically-hiding commitment from any one-way function
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Complete fairness in secure two-party computation
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Privacy and communication complexity
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Long-term security and universal composability
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Two-threshold broadcast and detectable multi-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Information-theoretic security without an honest majority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
On the Power of Two-Party Quantum Cryptography
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Completeness theorems with constructive proofs for finite deterministic 2-party functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
A zero-one law for secure multi-party computation with ternary outputs
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Exploring the limits of common coins using frontier analysis of protocols
TCC'11 Proceedings of the 8th conference on Theory of cryptography
The limits of common coins: further results
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Characterizing the cryptographic properties of reactive 2-party functionalities
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Universally composable synchronous computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Hi-index | 0.00 |
While general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model, there are SFE protocols (Goldreich et al. [STOC'87]) that are computationally secure (without fairness) in presence of an actively corrupted majority of the participants. Now, computational assumptions can usually be well justified at the time of protocol execution. The concern is rather a potential violation of the privacy of sensitive data by an attacker whose power increases over time. Therefore, we ask which functions can be computed with long-term security, where we admit computational assumptions for the duration of a computation, but require IT security (privacy) once the computation is concluded. Towards a combinatorial characterization of this class of functions, we also characterize the classes of functions that can be computed IT securely in the authenticated channels model in presence of passive, semi-honest, active, and quantum adversaries.