Correlated randomness in cryptographic protocols

Research output: Book/anthology/dissertation/reportPh.D. thesisResearch

  • Michael Nielsen
This dissertation concerns cryptologic research in secure multi-party computation with focus on the two-party setting. We construct information-theoretic protocols, which are proven secure by use of correlated randomness rather than computational assumptions. These protocols consider three different settings:

1. Computational complexity of secure arithmetic computation; We construct a protocol for secure two-party computation over a finite field. This protocol enjoys constant computational complexity, where complexity is measures as number of invoked field operations per multiplication gate to be computed securely.

2. Correlated circuits from truth tables; We present a design for correlated randomness based on truth tables, which gives a two-party protocol with fast execution time. This protocol easily scales to multiple parties, and enjoy popular properties, such as secure computation of linear functions without communication between the parties.

3. Correlated randomness as commodities; We construct a protocol for secure two-party computation over a finite field, which utilizes providers of correlated randomness. The protocol is secure and can tolerate up to roughly half of the providers colluding maliciously.
Original languageEnglish
PublisherAarhus Universitet
Number of pages147
Publication statusPublished - Apr 2019

Bibliographical note

Termination date: 23.04.2019

See relations at Aarhus University Citationformats

ID: 143271953