14 search results - page 3 / 3 » Coinductive Proofs for Basic Real Computation |
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
171
click to vote
EUROPKI
2009
Springer
14 years 7 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
81
Voted
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
CRYPTO
2005
Springer
15 years 3 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...