Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security

  • Robin Künzler
  • Jörn Müller-Quade
  • Dominik Raub
Conference paper

DOI: 10.1007/978-3-642-00457-5_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5444)
Cite this paper as:
Künzler R., Müller-Quade J., Raub D. (2009) Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security. In: Reingold O. (eds) Theory of Cryptography. TCC 2009. Lecture Notes in Computer Science, vol 5444. Springer, Berlin, Heidelberg

Abstract

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.

Keywords

long-term security information-theoretic security corrupted majority secure function evaluation 
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Robin Künzler
    • 1
  • Jörn Müller-Quade
    • 2
  • Dominik Raub
    • 1
  1. 1.Department of Computer ScienceETH ZurichZurichSwitzerland
  2. 2.IKS/EISS, Fakultät für InformatikUniversität Karlsruhe (TH)Germany

Personalised recommendations