首页 | 本学科首页   官方微博 | 高级检索  
     


The multireceiver commitment schemes
Authors:Shuhong Wang  Zhifeng Qi
Affiliation:(1) Security Research Center, Sumavision Technologies CO., LTD., Beijing, 100085, China
Abstract: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. Biography: WANG Shuhong (1977–), male, Ph. D., Principle Scientist, Director of Security Research Center, research direction: cryptography, information security and their applications.
Keywords:commitment scheme  multi-party computation  unconditional security  authentication code  verifiable secret sharing
本文献已被 维普 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号