A latency-free election scheme

被引：0

作者：

Gjosteen, Kristian ^{[1
]}

机构：

[1] Norwegian Univ Sci & Technol, Dept Math Sci, Trondheim, Norway

来源：

TOPICS IN CRYPTOLOGY - CT-RSA 2008, PROCEEDINGS | 2008年 / 4964卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show that solutions exists for one multiparty computation problem, that of elections, and more generally, addition in certain groups. The protocol construction is based on an interesting pseudo-random function family with a novel property.

引用

页码：425 / 436

页数：12

共 10 条

[1] Algesheimer J, 2002, LECT NOTES COMPUT SC, V2442, P417
[2] Damgård I, 2001, LECT NOTES COMPUT SC, V1992, P119
[3] DAMGARD I, 2002, SECURE ELECT VOTING
[4] Damgård I, 2006, LECT NOTES COMPUT SC, V4004, P555
[5] Damgård I, 2006, LECT NOTES COMPUT SC, V3876, P41
[6] FRANKLIN M, 1992, P 24 ACM STOC
[7] GJOSTEEN K, 2005, USENET MAY
[8] Groth J, 2006, LECT NOTES COMPUT SC, V4004, P339
[9] KIAYIAS A, 2002, LNCS, V2274, P141
[10] Paillier P, 1999, LECT NOTES COMPUT SC, V1592, P223

← 1 →