#### Filter Results:

#### Publication Year

1999

2001

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Alice wants to prove that she is young enough to borrow money from her bank, without revealing her age. She therefore needs a tool for proving that a committed number lies in a specific interval. Up to now, such tools were either inefficient (too many bits to compute and to transmit) or inexact (i.e. proved membership to a much larger interval). This paper… (More)

We present a solution to the Tiercé problem, in which two players want to know whether they have backed the same combination (but neither player wants to disclose its combination to the other one). The problem is also known as the socialist millionaires' problem, in which two millionaires want to know whether they happen to be equally rich. In our solution,… (More)

- Fabrice BOUDOT
- 2000

The Girault protocol [Eurocrypt'91] is a zero-knowledge like scheme which allows Alice to prove to Bob that she knows x, a discrete logarithm of y in base g modulo n, where n is a composite number whose factorization is unknown. It runs as follows: Alice randomly selects r ∈ [0, A] (where A n) and sends W = g r mod n to Bob. Bob sends to Alice a random… (More)

- ‹
- 1
- ›