摘要
Existing commitment schemes were addressed under the classic two-party scenario, However, popularity of the secure multi-party computation in today's lush network communication is motivating us to adopt more sophisticate commitment schemes. In this paper, we study for the first time multireceiver commitment in unconditionally secure setting, i.e., one committer promises a group of verifiers a common secret value (in computational setting it is trivial). We extend the Rivest model for this purpose and present a provably secure generic construction using multireceiver authentication codes (without secrecy) as building blocks. Two concrete schemes are proposed as its immediate implementations, which are almost as efficient as an optimal MRA-code. We believe using other primitives to construct variants of this concept will open doors for more interesting research.
Existing commitment schemes were addressed under the classic two-party scenario, However, popularity of the secure multi-party computation in today's lush network communication is motivating us to adopt more sophisticate commitment schemes. In this paper, we study for the first time multireceiver commitment in unconditionally secure setting, i.e., one committer promises a group of verifiers a common secret value (in computational setting it is trivial). We extend the Rivest model for this purpose and present a provably secure generic construction using multireceiver authentication codes (without secrecy) as building blocks. Two concrete schemes are proposed as its immediate implementations, which are almost as efficient as an optimal MRA-code. We believe using other primitives to construct variants of this concept will open doors for more interesting research.
基金
Supported by the Foundation of Development and Reform Commission of China under Grant High-Tech ([2007] 2367)