Rational Multi-Secret Sharing Scheme Based On Bit Commitment Protocol

Cai, Yongquan; Luo, Zhiyong; Yi, Yang

doi:10.4304/jnw.7.4.738-745

Cited by 6 publications

(6 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Training data set includes 12000 records, while validation data set includes 8000 records. Furthermore, each record includes 98 variables, 44 variables reflect the customer investment behavior and the rest are social statistics variables [14][15].…”

Section: B Variable Selectionmentioning

confidence: 99%

Customer Recognition of Network Finance Based on MKL Algorithm

Wang¹,

Lianggang²,

Wang³

2013

JNW

View full text Add to dashboard Cite

Given Bayes neural network method, the direct marketing customer repurchase behavior shall be built to analyze how different customer groups have different expectations on ATM services. Also, application of GMKL algorithm in customer recognition of network finance is proposed, training with the use of 20, 000 customer records extracted from RESSET/DB financial research database. First, transform the numerical characteristics of sample for collected customer record and normalize the data. Next, try to obtain multi-kernel function with different array modes of kernel function and compare the results, and the results show that accuracy of MKL in customer recognition of network finance can be up to 86. 4%, which is obvious higher than that of support vector machine

show abstract

Section: B Variable Selectionmentioning

confidence: 99%

Customer Recognition of Network Finance Based on MKL Algorithm

Wang¹,

Lianggang²,

Wang³

2013

JNW

View full text Add to dashboard Cite

show abstract

“…It has affected many areas such as machine learning, optimization problems, material synthesis, and communication systems [1]- [4]. In communication systems, Bit commitment (BC) is the basic building block of many cryptographic protocols, for instance, it is widely used in multi-party-based secure computations such as verified secret sharing schemes [5]. It is used in the access control of cloud computing as it preserves the users' privacy and provides a robust hiding access control policy [6].…”

Section: Introductionmentioning

confidence: 99%

A Secured Quantum Two-Bit Commitment Protocol for Communication Systems

et al. 2022

View full text Add to dashboard Cite

Bit commitment is an essential primitive in quantum cryptography. It is the basic building block of many cryptographic protocols in which it provides security over distrustful parties. This paper proposes a secured quantum two-bit commitment protocol for any two classical bits. The protocol contains two parties -a committer and a receiver -who share both quantum and classical communication channels. The main phases of this protocol are commitment and revealing phases where the concealing and binding conditions are proved in order to accept the commitment message. The proposed framework utilizes different security layers to hide specific quantum states in a superposition alongside trivial one qubit operations. The secured unitary transformations are applied by the two parties to meet the concealing and binding conditions. To verify the success of the proposed protocol, the measured output of the two parties are compared. The protocol operates under the assumption that the two parties might cheat and the possible existence of an eavesdropper.

show abstract

“…Shamir's scheme was based on the Lagrange interpolating polynomial [1], while Blakley's scheme was based on linear projective geometry [2]. Subsequently, secret sharing becomes an important research field of modern cryptography and information security, a lot of researches have been proposed [3][4][5][6][7]. Secret sharing can prevent the abuse of power, therefore, it is applied to realize the trust recommendation of trust management in the mobile Ad hoc networks (MANETs) [8].…”

Section: Introductionmentioning

confidence: 99%

Secret Sharing Member Expansion Protocol Based on ECC

Wu¹,

Li²,

Wang³

2015

TOCSJ

View full text Add to dashboard Cite

Abstract:The protocols for member expansion in secret sharing schemes are very useful for key management in dynamic topology networks. In order to reduce the computation complexity of the existed protocols for member expansion in secret sharing schemes, a new protocol is proposed based on the problem of elliptic curve discrete logarithm. This paper examines fifteen most recent patens that were awarded in the area of secret sharing. Unlike traditional detailed patent reviews that are focused on applying the simple secret sharing method, the proposed protocol has the following merits: 1) there is no trust center ; 2) only requesting broadcast 2 1 t + times to generate the sub-secret for the new participant and the new participant can verify the truth of the sub-secret; 3) the old participants can verify the new sub-secret by the noninteractive zero-knowledge proof protocol; 4) In the sub-secret generation stage, not only sub-secrets of old participants but also the sub-secret of new participant is secure. Compared to the existed protocols, the proposed protocol has lower computational complexity and less communications. Therefore, the proposed protocol has higher performance and is suitable for resource-constrained terminals of dynamic networks.

show abstract

Rational Multi-Secret Sharing Scheme Based On Bit Commitment Protocol

Cited by 6 publications

References 21 publications

Customer Recognition of Network Finance Based on MKL Algorithm

Customer Recognition of Network Finance Based on MKL Algorithm

A Secured Quantum Two-Bit Commitment Protocol for Communication Systems

Secret Sharing Member Expansion Protocol Based on ECC

Contact Info

Product

Resources

About