scholarly journals DISTRIBUTED TRUST IN ePAYMENTS SYSTEM

2014 ◽  
pp. 87-94
Author(s):  
K. P. Vidya
Keyword(s):  
Elliptic Curve ◽  
Efficient Method ◽  
Secret Sharing ◽  
Discrete Logarithm ◽  
Secret Sharing Scheme ◽  
Central Processor ◽  
Clearing House ◽  
Access Structures ◽  
Sharing Scheme ◽  
Level Zero

In this paper, a secret sharing scheme that is based on the Parallel Pollard rho Attack of the Elliptic Curve Discrete Logarithm Problem (ECDLP) is proposed for hierarchical access structures that can be activated dynamically. The shares of the scheme are distributed across two levels of participants but the reconstruction of the secret takes place at level zero which is the central processor or the trusted party of the scheme. The scheme finds its application in the Payments System of Banks and facilitates the replacement of paper cheques with eCheques. It also provides an efficient method of processing the payments at the Clearing House of Banks.

(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.

scholarly journals CONSTRUCTING AND IMPLEMENTING SOME PERFECT VERIFIABLE SECRET SHARING SCHEMES

2021 ◽  
Vol 2 (64) ◽  
pp. 13-17
Author(s):  
Mariya A. Gusarova ◽  
Keyword(s):  
Secret Sharing ◽  
Discrete Logarithm ◽  
Quantum Secret Sharing ◽  
Secret Sharing Scheme ◽  
Public Key Cryptosystems ◽  
Sharing Scheme ◽  
Cryptographic Attacks ◽  
Shamir Secret Sharing Scheme ◽  
Shamir Secret Sharing ◽  
Factorization Of Integers

Most of the existing public key cryptosystems are potentially vulnerable to cryptographic attacks as they rely on the problems of discrete logarithm and factorization of integers. There is now a need for algorithms that will resist attacks on quantum computers. The article describes the implementation of Shamir’s post-quantum secret sharing scheme using long arithmetic that can be applied in modern cryptographic modules. The implementation of the Pedersen – Shamir scheme is described, which allows preserving the property of the perfection of the Shamir scheme by introducing testability. The article presents graphs reflecting the influence of the verifiability property in the Shamir secret sharing scheme on the speed of its operation.

scholarly journals ANALISIS ATRIBUT KEAMANAN TERHADAP PERBAIKAN PROTOKOL GROUP KEY TRANSFER : PROTOKOL HSU

2017 ◽  
Vol 9 (1) ◽  
pp. 13
Author(s):  
I Made Mustika Kerta Astawa ◽  
Rahmi Nurazizah
Keyword(s):  
Secret Sharing ◽  
Discrete Logarithm ◽  
Main Idea ◽  
Cryptographic Protocols ◽  
Secret Sharing Scheme ◽  
Group Key ◽  
Type Group ◽  
Sharing Scheme ◽  
Diffie Hellman ◽  
Key Compromise Impersonation

Protocol Hsu et.al first introduced in 2012 and is the protocol type Group Key Transfer based Linear Shamir's Secret Sharing Scheme (LSSS). The main idea of this protocol is to use m-secret sharing perspective. This protocol assumes that the difficulty of discrete logarithm problem (DLP) (ie given  is computationally very difficult/not feasible to count ) and Cryptographyc Diffie Hellman (CDH) (ie given  and  it is computationally very difficult/not feasible to count ) in . Thus, it needs to analyze the security attributes to this mechanism Protocol Hsu. Good cryptographic protocols should meet the security attributes Known Security Key, Key-Compromise Impersonation Resillience, Unknown Key-Share Resillience, Key Control and Key Confirmation.

Sign in / Sign up

Export Citation Format

Share Document