viff
view doc/bibliography.txt @ 1434:066a6ff68f7c
Added my dissertation.
| author | Martin Geisler <mg@cs.au.dk> |
|---|---|
| date | Wed Mar 03 11:24:49 2010 +0100 (2 years ago) |
| parents | 0504115641a3 |
| children |
line source
1 .. -*- coding: utf-8 -*-
3 Bibliography
4 ============
6 .. note::
8 This list is far from complete. If you find more relevant
9 references then please `send us a mail`__ with the information.
11 .. __: mailto:viff-devel@viff.dk
13 The algorithms used by VIFF are published in various academic papers.
14 Here we will try to point out which parts of the code uses which
15 papers.
17 * The primary reference is Martin Geisler's PhD dissertation
18 [Geisler10]_. It covers the design and implementation of VIFF.
20 * An earlier reference is [DGKN]_. This paper describes the
21 asynchronous protocol secure against active adversaries implemented
22 in VIFF.
24 * The ``viff.shamir`` module is obviously based on [Shamir79]_.
26 * ``apps/millionaires.py``: Inspired by [Yao82]_.
28 * The default comparison operation (``Runtime.greater_than_equal``) is
29 based on the comparison protocol from [Toft05]_.
31 * Broadcast (``Runtime.broadcast``) is based on the original paper by
32 [Bracha84]_ and on the explanation by [Cachin05]_.
34 * The pseudo-random secret sharing (PRSS) in ``viff.prss`` is
35 described in [CDI05]_. The
36 :meth:`~viff.passive.PassiveRuntime.prss_share_bit_double` method
37 uses a protocol described in [Damgård08]_.
39 * The protocol for equality testing with secret shared result is from
40 [Nishide07]_.
43 .. [Bracha84] G. Bracha, *An asynchronous [(n-1)/3]-resilient
44 consensus protocol*, Proc 3rd ACM Symposium on Principles of
45 Distributed Computing (PODC), 1984, 154-162.
47 .. [Cachin05] Christian Cachin, *Security and Fault-tolerance in
48 Distributed Systems*, ETHZ, 2005, PDF__.
50 .. __: http://www.zurich.ibm.com/~cca/sft05/agreement.pdf
52 .. [CDI05] Ronald Cramer, Ivan Damgård, and Yuval Ishai, *Share
53 Conversion, Pseudorandom Secret-Sharing and Applications to Secure
54 Computation*, Proc of TCC 2005, LNCS 3378, PS__.
56 .. __: http://www.cs.technion.ac.il/~yuvali/pubs/CDI05.ps
58 .. [Damgård08] Ivan Damgård and Rune Thorbek, *Efficient Conversion of
59 Secret-shared Values Between Different Fields*, Cryptology ePrint
60 Archive: `Report 2008/221`__.
62 .. __: http://eprint.iacr.org/2008/221
64 .. [DGKN] Ivan Damgård, Martin Geisler, Mikkel Krøigaard, Jesper Buus
65 Nielsen, *Asynchronous Multiparty Computation: Theory and
66 Implementation*, Cryptology ePrint Archive: `Report 2008/415`__.
68 .. __: http://eprint.iacr.org/2008/415
70 .. [Geisler10] Martin Geisler, *Cryptographic Protocols: Theory and
71 Implementation*, PhD Dissertation, Aarhus University February 2010.
72 `Download`__.
74 .. __: http://bitbucket.org/mg/dissertation/downloads/
76 .. [Nishide07] Takashi Nishide and Kazuo Ohta, *Constant-Round
77 Multiparty Computation for Interval Test, Equality Test, and
78 Comparison*, IEICE Transactions, 90-A (5): 960-968.
80 .. [Shamir79] Adi Shamir, *How to share a secret*, Communications of
81 the ACM, 22 (11): 612-613.
83 .. [Toft05] Tomas Toft, *Secure Integer Computation with Applications
84 in Economics*, PhD Progress Report, July 2005, PDF__.
86 .. __: http://www.daimi.au.dk/~ttoft/publications/progress.pdf
88 .. [Yao82] Andrew Chi-Chih Yao, *Protocols for Secure Computations*,
89 FOCS 1982, 160-164.