ACAC Seminar Abstract

ACAC Seminar Abstract

ACAC Seminars

ACAC Seminar Abstract

Zero-knowledge interval proofs and other cryptographic problems involving intervals

Speaker: Berry Schoenmakers
Date, Time: Fri, 13 Mar 2009 15:00

By an interval (or range) we mean a set of consecutive integers. In this talk we consider several cryptographic problems involving intervals. We present some of the nicer and sometimes surprising results we've obtained, namely efficient algorithms and protocols for pseudorandom random generation of bounded integers, zero-knowledge interval proofs for committed integers, and--time permitting--secure multiparty computation for integer comparison of encrypted (or shared) integers.

Back to the top of this page