Simple Threshold RSA Signature Scheme Based on Simple Secret Sharing

2005 ◽  
pp. 186-191 ◽  
Author(s):  
Shaohua Tang
Keyword(s):  
Secret Sharing ◽  
Signature Scheme

(t,k,n) Multi-Blind Proxy Signature Scheme on Elliptic Curve

2011 ◽  
Vol 130-134 ◽  
pp. 291-294
Author(s):  
Guang Liang Liu ◽  
Sheng Xian Xie ◽  
Wei Fu
Keyword(s):  
Elliptic Curve ◽  
Secret Sharing ◽  
Proxy Signature ◽  
Elliptic Curve Cryptosystem ◽  
Secret Sharing Scheme ◽  
Signature Scheme ◽  
Forgery Attack ◽  
Threshold Secret Sharing ◽  
Sharing Scheme ◽  
Security Properties

On the elliptic curve cryptosystem proposed a new multi-proxy signature scheme - (t, k, n) threshold blind proxy signature scheme.In new program blind proxy signature and (t,k,n) threshold secret sharing scheme will be combined, and will not over-concentration of the rights of the blind proxy signer .Computation of the program is small, security is high, the achieve efficiency and the utility is better .can prevent a malicious user's forgery attack and have the security properties of proxy signature.

Applying two channels to vector space secret sharing based multi-signature scheme

2005 ◽  
Vol 6 (1) ◽  
pp. 56-62
Author(s):  
Qing-hua Xiao ◽  
Ling-di Ping ◽  
Xue-zeng Pan
Keyword(s):  
Vector Space ◽  
Secret Sharing ◽  
Signature Scheme

Applying two channels to vector space secret sharing based multi-signature scheme

2005 ◽  
Vol 6A (1) ◽  
pp. 56-62
Author(s):  
Qing-hua Xiao ◽  
Ling-di Ping ◽  
Xue-zeng Pan
Keyword(s):  
Vector Space ◽  
Secret Sharing ◽  
Signature Scheme

scholarly journals Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing

Cryptography ◽  
2020 ◽  
Vol 4 (3) ◽  
pp. 25
Author(s):  
Georgia Tsaloli ◽  
Gustavo Banegas ◽  
Aikaterini Mitrokotsa
Keyword(s):  
Secret Sharing ◽  
Security And Privacy ◽  
Sensitive Information ◽  
Signature Scheme ◽  
Secret Data ◽  
Public Verifiability ◽  
Client Side ◽  
Homomorphic Signatures ◽  
Multiple Clients ◽  
Provably Secure

Often clients (e.g., sensors, organizations) need to outsource joint computations that are based on some joint inputs to external untrusted servers. These computations often rely on the aggregation of data collected from multiple clients, while the clients want to guarantee that the results are correct and, thus, an output that can be publicly verified is required. However, important security and privacy challenges are raised, since clients may hold sensitive information. In this paper, we propose an approach, called verifiable additive homomorphic secret sharing (VAHSS), to achieve practical and provably secure aggregation of data, while allowing for the clients to protect their secret data and providing public verifiability i.e., everyone should be able to verify the correctness of the computed result. We propose three VAHSS constructions by combining an additive homomorphic secret sharing (HSS) scheme, for computing the sum of the clients’ secret inputs, and three different methods for achieving public verifiability, namely: (i) homomorphic collision-resistant hash functions; (ii) linear homomorphic signatures; as well as (iii) a threshold RSA signature scheme. In all three constructions, we provide a detailed correctness, security, and verifiability analysis and detailed experimental evaluations. Our results demonstrate the efficiency of our proposed constructions, especially from the client side.

A (t, n) Threshold Signature Scheme Based on Factorial Decompose Theorem of Polynomial

2011 ◽  
Vol 50-51 ◽  
pp. 49-53
Author(s):  
Yong Quan Cai ◽  
Fu Lai Cheng
Keyword(s):  
Secret Sharing ◽  
Threshold Value ◽  
Group Signature ◽  
Secret Sharing Scheme ◽  
Signature Scheme ◽  
Threshold Signature ◽  
Collusion Attack ◽  
Sharing Scheme ◽  
Current Threshold ◽  
Digital Signature Scheme

The traditional threshold signature scheme is a combination of the digital signature scheme and the secret sharing scheme. Any group of t (threshold value) or more players can reconstruct the secret together but no group of fewer than t players can in secret sharing scheme. Because of this property of secret sharing scheme, the current threshold signature scheme has a natural weakness in the anti-collusion attack. A new threshold signature scheme based on the factorial decompose theorem is designed successfully without the secret sharing scheme in order to get the ability of anti-collusion attacks. It not only has the property of group signature and threshold signature, but also has some good features including traceability，robustness and resisting forgery attacks.

scholarly journals Distributed Functional Signature with Function Privacy and Its Application

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Muhua Liu ◽  
Lin Wang ◽  
Qingtao Wu ◽  
Jianqiang Song
Keyword(s):  
Secret Sharing ◽  
Cloud Service ◽  
Cloud Security ◽  
Evaluation Procedure ◽  
Signature Scheme ◽  
New Model ◽  
Formula One ◽  
One Way Function ◽  
And Function ◽  
A Share

We introduce a novel notion of distributed functional signature. In such a signature scheme, the signing key for function f will be split into n shares sk f i and distributed to different parties. Given a message m and a share sk f i , one can compute locally and obtain a pair signature f i m , σ i . When given all of the signature pairs, everyone can recover the actual value f m and corresponding signature σ . When the number signature pairs are not enough, nobody can recover the signature f m , σ . We formalize the notion of function privacy in this new model which is not possible for the standard functional signature and give a construction from standard functional signature and function secret sharing based on one-way function and learning with error assumption. We then consider the problem of hosting services in multiple untrusted clouds, in which the verifiability and program privacy are considered. The verifiability requires that the returned results from the cloud can be checked. The program privacy requires that the evaluation procedure does not reveal the program for the untrusted cloud. We give a verifiable distributed secure cloud service scheme from distributed functional signature and prove the securities which include untrusted cloud security (program privacy and verifiability) and untrusted client security.

Sign in / Sign up

Export Citation Format

Share Document