85 search results - page 5 / 17 » Commitment Schemes and Zero-Knowledge Protocols |
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
TCC
2009
Springer
15 years 10 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
86
Voted
CRYPTO
1995
Springer
15 years 1 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...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...