9 search results - page 1 / 2 » Efficient Proofs that a Committed Number Lies in an Interval |
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
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 spe...
CRYPTO
1995
Springer
13 years 8 months ago
1995
Springer
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
CADE
2008
Springer
14 years 5 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
ENTCS
2008
13 years 4 months ago
2008
RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctl...
EOR
2006
13 years 4 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...