Statistical Zero-Knowledge Arguments: Theory and Practice

Helger Lipmaa. Statistical Zero-Knowledge Arguments: Theory and Practice. In 4th European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS 2004), Jyväskylä, Finland, July 24--28, 2004. Invited survey.

File: [.ps.bz2 (74 KB), .pdf (183 KB)] pdf recommended.

Abstract:

During a statistical zero-knowledge argument, the arguer convinces the verifier on the truth of an assertment, without revealing next to nothing---but the truth of the assertment---even to an omnipotent verifier. The crucial part here is ``next to nothing'': compared to perfect zero-knowledge arguments where absolutely nothing (but the truth of the assertment) can be revealed, statistical zero-knowledge arguments are often much more practical.

In this presentation, we will survey some recent developments in this area. We will both touch the theoretical and practical aspects of statistical zero-knowledge, ending the survey with my recent results that connect Hilbert's 10th problem to finding practical statistical zero-knowledge arguments..

Keywords: Arguments of knowledge, Diophantine complexity, electronic auctions, electronic voting, integer commitment scheme, statistical zero knowledge.

Slides:

• conferences slides

• Helger Lipmaa

Page by Helger Lipmaa. Send your inqueries to <helger.lipmaa>">gmail.com.