Desmedt, Y; DiCrescenzo, G; Burmester, M; (1995) Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In: Pieprzyk, J and SafaviNaini, R, (eds.) ADVANCES IN CRYPTOLOGY - ASIACRYPT '94. (pp. 21 - 32). SPRINGER-VERLAG BERLIN
Full text not available from this repository.
We show how to construct a perfect zero-knowledge threshold proof of knowledge of an isomorphism between two graphs, and extend this result to general access structures. The provers work sequentially and are not allowed to interact among themselves, so the number of message communications each prover sends is the same as with the Goldreich-Micali-Wigderson  scheme. Our construction is based on multiplicative sharing schemes in which the secret belongs to a group which is not necessarily Abelian.
|Title:||Multiplicative non-abelian sharing schemes and their application to threshold cryptography|
|Event:||4th International Conference on the Theory and Applications of Cryptology (ASIACRYPT 94)|
|Dates:||1994-11-28 - 1994-12-01|
|Keywords:||PROOF SYSTEMS, SIGNATURES, SECRET|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record