Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
スポンサーリンク
概要
- 論文の詳細を見る
This paper presents a non-interactive verifiable secret sharing scheme (VSS) tolerating a dishonest majority based on data pre-distributed by a trusted authority. As an application of this VSS scheme we present very efficient unconditionally secure protocols for performing multiplication of shares based on pre-distributed data which generalize two-party computations based on linear pre-distributed bit commitments. The main results of this paper are a non-interactive VSS, a simplified multiplication protocol for shared values based on pre-distributed random products, and non-interactive zero knowledge proofs for arbitrary polynomial relations. The security of the schemes is proved using the UC framework.
著者
-
NASCIMENTO Anderson
Department of Electrical Engineering, University of Brasilia (UnB)
-
HANAOKA Goichiro
National Institute of Advanced Industrial Science and Technology
-
IMAI Hideki
National Institute of Advanced Industrial Science and Technology
-
DOWSLEY Rafael
Department of Electrical Engineering, University of Brasilia
-
MÜLLER-QUADE Jörn
Universität Karlsruhe, Institut für Algorithmen und Kognitive Systeme
-
OTSUKA Akira
National Institute of Advanced Industrial Science and Technology (AIST)
関連論文
- A Fault Analytic Method against HB+
- Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
- Traitor Tracing Scheme Secure against Adaptive Key Exposure and its Application to Anywhere TV Service(Discrete Mathematics and Its Applications)
- A Novel Probabilistic Passive Attack on the Protocols HB and HB^+
- New Security Architecture for Mobile IPv6 Networks
- The MAC-based Construction of Strong Multiple Encryption
- Spectroscopic Studies of the Solar Corona I. Spatial Variations in Line Parameters of Green and Red Coronal Lines
- Daily Urinary Excretion of Bisphenol A
- Formal Security Treatments for IBE-to-Signature Transformation : Relations among Security Notions
- Key-Insulated Public Key Encryption with Auxiliary Helper Key : Model, Constructions and Formal Security Proofs(Information Theory and Its Applications)
- Efficient Identity-Based Encryption with Tight Security Reduction(Information Theory and Its Applications)
- A New Key-Insulated Public Key Encryption Scheme with Auxiliary Helper Key
- On the oblivious transfer capacity of the erasure channel
- Efficient Provider Authentication for Bidirectional Broadcasting Service
- A Trade-off Traitor Tracing Scheme
- Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
- How to Break COT-Based Fingerprinting Schemes and Design New One(Cryptography and Information Security, Information Theory and Its Applications)
- A Fault Analytic Method against HB^+
- How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model
- Oblivious Transfer Based on the McEliece Assumptions
- A Theoretical Framework for Constructing Matching Algorithms Secure against Wolf Attack