Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.14/197445
39 Visitors
43 Hits
0 Downloads
- Title
- Active security in multiparty computation over black-box groups
- Related
- International Conference on Security and Cryptography for Networks (8th : 2012) (5 - 7 September 2012 : Amalfi, Italy)
- Related
- Visconti, Ivan and De Prisco, Roberto. Security and cryptography for networks : 8th International Conference, SCN 2012, Amalfi, Italy, September 5-7, 2012, proceedings, p.503-521
- DOI
- 10.1007/978-3-642-32928-9_28
- Related
- Lecture notes in computer science Vol. 7485
- Publisher
- Heidelberg, Germany : Springer-Verlag
- Date
- 2012
- Author/Creator
- Desmedt, Yvo
- Author/Creator
- Pieprzyk, Josef
- Author/Creator
- Steinfeld, Ron
- Description
- Most previous work on unconditionally secure multiparty computation has focused on computing over a finite field (or ring). Multiparty computation over other algebraic structures has not received much attention, but is an interesting topic whose study may provide new and improved tools for certain applications. At CRYPTO 2007, Desmedt et al introduced a construction for a passive-secure multiparty multiplication protocol for black-box groups, reducing it to a certain graph coloring problem, leaving as an open problem to achieve security against active attacks. We present the first n-party protocol for unconditionally secure multiparty computation over a black-box group which is secure under an active attack model, tolerating any adversary structure Δ satisfying the Q³ property (in which no union of three subsets from Δ covers the whole player set), which is known to be necessary for achieving security in the active setting. Our protocol uses Maurer's Verifiable Secret Sharing (VSS) but preserves the essential simplicity of the graph-based approach of Desmedt et al, which avoids each shareholder having to rerun the full VSS protocol after each local computation. A corollary of our result is a new active-secure protocol for general multiparty computation of an arbitrary Boolean circuit.
- Description
- 19 page(s)
- Subject Keyword
- active security
- Subject Keyword
- black-box
- Subject Keyword
- general adversary structures
- Subject Keyword
- graph colouring
- Subject Keyword
- multi-party computation
- Subject Keyword
- non-abelian group
- Resource Type
- conference paper
- Organisation
- Macquarie University. Dept. of Computing
- Identifier
- http://hdl.handle.net/1959.14/197445
- Identifier
- ISBN:9783642329272
- Identifier
- ISSN:0302-9743
- Identifier
- mq-rm-2011010300
- Identifier
- mq_res-ext-2-s2.0-84866706118
- Language
- eng
- Reviewed
