This list is far from complete. If you find more relevant references then please send us a mail with the information.

The algorithms used by VIFF are published in various academic papers. Here we will try to point out which parts of the code uses which papers.

  • The primary reference is Martin Geisler’s PhD dissertation [Geisler10]. It covers the design and implementation of VIFF.
  • An earlier reference is [DGKN]. This paper describes the asynchronous protocol secure against active adversaries implemented in VIFF.
  • The viff.shamir module is obviously based on [Shamir79].
  • apps/ Inspired by [Yao82].
  • The default comparison operation (Runtime.greater_than_equal) is based on the comparison protocol from [Toft05].
  • Broadcast (Runtime.broadcast) is based on the original paper by [Bracha84] and on the explanation by [Cachin05].
  • The pseudo-random secret sharing (PRSS) in viff.prss is described in [CDI05]. The prss_share_bit_double() method uses a protocol described in [Damgård08].
  • The protocol for equality testing with secret shared result is from [Nishide07].
[Bracha84]G. Bracha, An asynchronous [(n-1)/3]-resilient consensus protocol, Proc 3rd ACM Symposium on Principles of Distributed Computing (PODC), 1984, 154-162.
[Cachin05]Christian Cachin, Security and Fault-tolerance in Distributed Systems, ETHZ, 2005, PDF.
[CDI05]Ronald Cramer, Ivan Damgård, and Yuval Ishai, Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation, Proc of TCC 2005, LNCS 3378, PS.
[Damgård08]Ivan Damgård and Rune Thorbek, Efficient Conversion of Secret-shared Values Between Different Fields, Cryptology ePrint Archive: Report 2008/221.
[DGKN]Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus Nielsen, Asynchronous Multiparty Computation: Theory and Implementation, Cryptology ePrint Archive: Report 2008/415.
[Geisler10]Martin Geisler, Cryptographic Protocols: Theory and Implementation, PhD Dissertation, Aarhus University February 2010. Download.
[Nishide07]Takashi Nishide and Kazuo Ohta, Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison, IEICE Transactions, 90-A (5): 960-968.
[Shamir79]Adi Shamir, How to share a secret, Communications of the ACM, 22 (11): 612-613.
[Toft05]Tomas Toft, Secure Integer Computation with Applications in Economics, PhD Progress Report, July 2005, PDF.
[Yao82]Andrew Chi-Chih Yao, Protocols for Secure Computations, FOCS 1982, 160-164.

Previous topic


Next topic


This Page