viff
view doc/todo.txt @ 1575:cfb8e1485006
Updated email address.
| author | Thomas P Jakobsen <tpj@cs.au.dk> |
|---|---|
| date | Wed Dec 15 13:00:00 2010 +0100 (17 months ago) |
| parents | eb4dfa98b439 |
| children |
line source
1 Planned Work on VIFF
2 ====================
4 This document collects the bigger pieces of work we plan to do on
5 VIFF --- pieces too big for the bug tracker.
8 Active Security
9 ---------------
11 The protocol implemented in :mod:`viff.active` is (believed to be)
12 secure against active adversaries, but only as long as they don't
13 actually try to cheat! In other words, the players will crash in bad
14 ways if malformed data is received or too few shares are received.
16 The following points should be addressed:
18 * Error correction. The honest players must tolerate being sent wrong
19 shares or no shares at all from the corrupt players.
21 This is related to Issue4_, Issue29_, and Issue70_.
23 .. _Issue4: http://tracker.viff.dk/issue4
24 .. _Issue29: http://tracker.viff.dk/issue29
25 .. _Issue70: http://tracker.viff.dk/issue70
27 * Byzantine agreement. After the preprocessing phase a Byzantime
28 agreement protocol should be run in order to determine if all honest
29 players are ready to continue.
31 At the moment an honest players simply aborts the protocol if it
32 detects any form of cheating --- the "idea" being that this will
33 make the other honest players crash too, thereby effectively halting
34 the protocol.
36 Covert Adversaries
37 ------------------
39 Implement an actively secure protocol for a covert adversary and
40 threshold ``t < n/2``. The goal is to have almost the same complexity
41 as for the passive case. Martin Geisler is working on a paper
42 describing a solution.
