Issue 11: Constant round multiplication

Created on 2008-03-14.10:00:04 by mg, last changed 2008-09-23.17:41:56 by mg.

Messages
msg213 (view)	Author: mg	Date: 2008-09-23.17:41:55
Tomas, would this be something for you to implement?
msg112 (view)	Author: mg	Date: 2008-07-11.22:13:28
Having this implemented would also be important when/if we get a compiler as mentioned here: http://article.gmane.org/gmane.comp.cryptography.viff.devel/313
msg16 (view)	Author: mg	Date: 2008-03-14.10:00:04
We could implement the constant round multiplication protocol of Bar-Ilan and Beaver from PODC 1989 and test it against a standard logarithmic round protocol.

History
Date	User	Action	Args
2008-09-23 17:41:56	mg	set	nosy: + t.toft type: feature -> wish messages: + msg213
2008-09-23 16:20:33	tpj	set	type: feature
2008-07-11 22:13:29	mg	set	status: unread -> chatting messages: + msg112
2008-03-14 10:00:04	mg	create

Issue11