Add to ORKGWe give a construction of statistically-hiding commitment schemes (ones where the hiding property holds information theoretically), based on the minimal cryptographic assumption that one-way functions exist. Our construction employs two-phase commitment schemes, recently constructed by Nguyen, Ong and Vadhan (FOCS ‘06), and universal oneway hash functions introduced and constructed by Naor and Yung (STOC ‘89) and Rompel (STOC ‘90). Categories and Subject Descriptors F.1.2 [Modes of Computation]: Interactive and reactive computatio
Abstract. In this paper we show how to convert a statistically binding but computationally concealin...
We present and compare definitions of the notion of "statisticallyhiding" protocols, and we propose ...
[出版社版]We improve the upper bound on the round complexity for perfectly concealing bit commitment sch...
Determining the minimal assumptions needed to construct various cryptographic building blocks has be...
We give a construction of statistically hiding commitment schemes (those in which the hiding propert...
Abstract. We present a lower bound on the round complexity of a natural class of black-box construct...
AbstractConstructions of cryptographic primitives based on general assumptions (e.g., one-way functi...
The results presented in the thesis show how to convert a statistically binding but computationally ...
We propose the first black-box construction of non-malleable commitments according to the standard n...
We define a new primitive that we call a somewhere statistically binding (SSB) commitment scheme, wh...
We study the round complexity of various cryptographic protocols. Our main result is a tight lower b...
Abstract. We present a statistically-hiding commitment scheme allowing commitment to arbitrary size ...
Non-malleable commitment is one of the most fundamental cryptographic primitives in that it is often...
We explicitly show the upper bound on the round complexity for perfectly concealing bit commitment s...
The information-theoretic approach to security entails harnessing the correlated randomness availabl...
Abstract. In this paper we show how to convert a statistically binding but computationally concealin...
We present and compare definitions of the notion of "statisticallyhiding" protocols, and we propose ...
[出版社版]We improve the upper bound on the round complexity for perfectly concealing bit commitment sch...
Determining the minimal assumptions needed to construct various cryptographic building blocks has be...
We give a construction of statistically hiding commitment schemes (those in which the hiding propert...
Abstract. We present a lower bound on the round complexity of a natural class of black-box construct...
AbstractConstructions of cryptographic primitives based on general assumptions (e.g., one-way functi...
The results presented in the thesis show how to convert a statistically binding but computationally ...
We propose the first black-box construction of non-malleable commitments according to the standard n...
We define a new primitive that we call a somewhere statistically binding (SSB) commitment scheme, wh...
We study the round complexity of various cryptographic protocols. Our main result is a tight lower b...
Abstract. We present a statistically-hiding commitment scheme allowing commitment to arbitrary size ...
Non-malleable commitment is one of the most fundamental cryptographic primitives in that it is often...
We explicitly show the upper bound on the round complexity for perfectly concealing bit commitment s...
The information-theoretic approach to security entails harnessing the correlated randomness availabl...
Abstract. In this paper we show how to convert a statistically binding but computationally concealin...
We present and compare definitions of the notion of "statisticallyhiding" protocols, and we propose ...
[出版社版]We improve the upper bound on the round complexity for perfectly concealing bit commitment sch...