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.

• （社）電子情報通信学会の論文
• 2011-02-01

著者

• Nascimento A

  Univ. Tokyo Tokyo Jpn

• MUELER-QUADE Joern

  Universitaet Karlsruhe Institut fuer Algorithmen und Kognitive Systeme

• Imai Hideki

  Faculty Of Science And Engineering Chuo University:research Center For Information Security (rcis) N

• Otsuka A

  Ipa Tokyo Jpn

• DOWSLEY Rafael

  Department of Electrical Engineering, University of Brasilia

• MÜLLER-QUADE Jörn

  Universität Karlsruhe, Institut für Algorithmen und Kognitive Systeme

• Hanaoka Goichiro

  Institute Of Industrial Science The University Of Tokyo

• Hanaoka Goichiro

  3rd Department Institute Of Industrial Science The University Of Tokyo

• Nascimento Anderson

  Department Of Electrical Engineering University Of Brasilia

• Imai Hideki

  3rd Department Institute Of Industrial Science The University Of Tokyo

• Imai Hideki

  National Inst. Of Advanced Industrial Sci. & Technol. (aist) Tokyo Jpn

• Otsuka Akira

  National Inst. Advanced Industrial Sci. And Technol. Tokyo Jpn

• Hanaoka G

  National Institute Of Advanced Industrial Science And Technology

• Hanaoka Goichiro

  National Inst. Of Advanced Industrial Sci. And Technol. Tokyo Jpn

• Dowsley Rafael

  Department Of Electrical Engineering University Of Brasilia

• Imai Hideki

  National Inst. Advanced Industrial Sci. And Technol. Tokyo Jpn

• Imai Hideki

  National Astronomical Observatory

• Muller-quade Jorn

  Universitat Karlsruhe Institut Fur Algorithmen Und Kognitive Systeme

関連論文

• Information Theoretical Secure Oblivious Polynomial Evaluation : Model, Bounds and Constructions
• Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
• Extension of Broadcasting Service by Using Electronic Tokens(Contents Technology and Web Information Systems)
• Traitor Tracing Scheme Secure against Adaptive Key Exposure and its Application to Anywhere TV Service(Discrete Mathematics and Its Applications)
• Unconditionally Secure Chaffing-and-Winnowing
• A New Quaternion Design for Space-Time-Polarization Block Code with Full Diversity
• A Novel Probabilistic Passive Attack on the Protocols HB and HB^+
• Smallest Size of Circulant Matrix for Regular (3, L) and (4, L) Quasi-Cyclic LDPC Codes with Girth 6
• New Security Architecture for Mobile IPv6 Networks
• Lightweight Privacy-Preserving Authentication Protocols Secure against Active Attack in an Asymmetric Way
• Asymmetric RFID System Secure against Active Attack
• The MAC-based Construction of Strong Multiple Encryption
• Efficient Strong Multiple Encryption from Relaxed Conditions
• ID-based Encryption for Directed Acyclic Graph Hierarchies : Unification of Key-evolving Encryption Primitives (Extended Abstract)
• Shielding Asymmetric Cryptosystems from Decryption Failures
• A Bandwidth-Saving Public Key Encryption Conversion Scheme
• Towards Removing Random Oracles from OAEP
• Invisibly Sanitizable Digital Signature Scheme
• On Strictly Geometrically Uniform Codes: Construction and New Codes
• An Efficient 2-Secure and Short Random Fingerprint Code and Its Security Evaluation
• Flaws in Robust Optimistic Mix-Nets and Stronger Security Notions(Protocol, Cryptography and Information Security)
• An Algorithm for Cryptanalysis of Certain Keystream Generators Suitable for High-Speed Software and Hardware Implementations : Special Section on Cryptography and Information Security
• A Novel Fast Correlation Attack Suitable for Simple Hardare Implementation
• Spectroscopic Studies of the Solar Corona I. Spatial Variations in Line Parameters of Green and Red Coronal Lines
• Daily Urinary Excretion of Bisphenol A
• Birthday Paradox Based Security Analysis of Certain Broadcast Encryption Schemes(Information Security)
• A Novel Approach to Algebraic and Fast Correlation Attacks for Cryptanalysis of Certain Keystream Generators
• CCA-Secure Public Key Encryption without Group-Dependent Hash Functions
• Formal Security Treatments for IBE-to-Signature Transformation : Relations among Security Notions
• A Strongly Unforgeable Signature under the CDH Assumption without Collision Resistant Hash Functions
• 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
• Security Tightness Evaluation of Fujisaki-Okamoto Conversion in Identity Based Encryption
• Searchable Public-key Broadcast Encryption
• Relations among Notions of Security for Identity Based Encryption Schemes (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
• Towards Security Enhancement with Efficient Reduction for Identity Based Encryption
• CCA-secure IBE Scheme with Tight Security Reduction based on the Gap BDH Assumption
• A Remark on GEM
• An Implementation of KPS with Distributed Trust
• Personal Entropy from Graphical Passwords : Methods for Quantification and Practical Key Generation(Cryptography and Information Security)(Information Theory and Its Applications)
• Managing Encryption and Key Publication Independently in Digital Rights Management Systems (Applications) (Cryptography and Information Security)
• On Evaluating the Entropy of Graphical Passwords
• Discussions on Unconditionally Secure VSS Robust against Dishonest Majority
• Discussions on Unconditionally Secure VSS Robust against Dishonest Majority
• An Unconditionally Secure Electronic Cash Scheme with Computational Untraceability(Special Section on Cryptography and Information Security)
• A Digital Signature Scheme on ID-Based Key-Sharing Infrastructures : Special Section on Cryptography and Information Security
• Unconditionally Secure Authenticated Encryption(Discrete Mathematics and Its Applications)
• Efficient Unconditionally Secure Digital Signatures (Asymmetric Cipher) (Cryptography and Information Security)
• Efficient Unconditionally Secure Digital Signatures
• A Traitor Traceable Conference System with Dynamic Sender(Special Section on Cryptography and Information Security)
• Efficient Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code
• Improving the Secure Electronic Transaction Protocol by Using Signcryption
• Optimal Unconditionally Secure ID-Based Key Distribution Scheme for Large-Scaled Networks : Special Section on Cryptography and Information Security
• An Optimization of Credit-Based Payment for Electronic Toll Collection Systems
• Realizing the Menezes-Okamoto-Vanstone (MOV) Reduction Efficiently for Ordinary Elliptic Curves
• On the oblivious transfer capacity of the erasure channel
• Deforestation and Degradation of Natural Resources in Ethiopia : Forest Management Implications from a Case Study in the Belete-Gera Forest
• Traceability Schemes against Illegal Distribution of Signed Documents(Discrete Mathematics and Its Applications)
• The Role of Arbiters for Unconditionally Secure Authentication(Discrete Mathematics and Its Applications)
• New Short Signature Scheme without Random Oracles
• Efficient Provider Authentication for Bidirectional Broadcasting Service
• A Trade-off Traitor Tracing Scheme
• Information-Theoretically Secure Key Insulated Encryption : Models, Bounds and Constructions(Cryptography and Information Security)(Information Theory and Its Applications)
• Public Key Encryption Schemes from the (B)CDH Assumption with Better Efficiency
• Between Hashed DH and Computational DH : Compact Encryption from Weaker Assumption
• A Formulation of Key Privacy in Plaintext Checking Attack Model
• 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)
• Adaptive Equalization with Dual Diversity-Combining (Special Issue on Land Mobile/Portable Propagation)
• A Fault Analytic Method against HB^+
• How to List-up Weak IVs and Weak Keys in WEP : Swap Operations and Weak Patterns
• Secure Broadcast System with Simultaneous Individual Messaging
• 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
• Methods for Restricting Message Space in Public-Key Encryption
• A Theoretical Framework for Constructing Matching Algorithms Secure against Wolf Attack

もっと見る 閉じる

スポンサーリンク