Improved Multi-secret Sharing Scheme Based on One-Way Function

Yong-Jun, Geng; Guo, Lizheng; Zheng, Min

doi:10.11591/telkomnika.v12i6.5483

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…p2p network is a decentralized network in which each peer acts as both client and server, which makes it more applicable on emerging systems that consist mostly of mobile nodes. p2p network is also widely used in different applications such as secure chatting, distributed cash system [13], distributed data sharing [4] and distributed secret sharing [9] [18]. The open nature of p2p networks and the ability of almost everyone to join the network make some systems such as [8] to use a private overlay at p2p networks called friendto-friend (f2f) network as their underlying communication scheme to ensure secrecy and anonymity of participants beyond direct peer nodes [6].…”

Section: Introductionmentioning

confidence: 99%

"An Address Propagation Model in P2P and F2P Networks"

Kamel

Ligeti

Nagy

2019

Studia UBB Informatica

View full text Add to dashboard Cite

Using identifiers to address the member nodes at DHT based peer-to-peer (p2p) networks provides structured method of addressing the nodes. The node lookup is then used to find the equivalent communication address of a given identifier. One of the main concerns is how to find the communication addresses efficiently, especially if a node has joined or rejoined the network recently. In this paper an address propagation model has been proposed which is used as a solution in friend-to-friend (f2f) overlays at p2p networks. The model keeps the required communication addresses up-to-date in order to reduce the need of any node to perform the lookup process. It allows each node to maintain the addresses in a distributed manner using bucket based broadcasting and guarantees that it has the current up-to-date addresses of its friend nodes as a necessary information to establish a direct connection without any centralized scheme. Despite adding some traffic overhead to the network, the proposed address propagation process is secure and fast.

show abstract

Section: Introductionmentioning

confidence: 99%

"An Address Propagation Model in P2P and F2P Networks"

Kamel

Ligeti

Nagy

2019

Studia UBB Informatica

View full text Add to dashboard Cite

show abstract

“…secret sharing, secret splitting, and visual cryptography can be implemented to solve this problem [2]- [3]. The secret splitting and secret sharing protocols can be applied to transform a message into several cipher-text segments that can be distributed to n people [4]. In secret splitting protocols, n cipher-text are required to recover the original message.…”

Section: Introductionmentioning

confidence: 99%

Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual Cryptography for Security of Handwritten Images

Sugianto¹,

Suharjito²,

Surantha³

2018

TELKOMNIKA

View full text Add to dashboard Cite

The secret sharing is a method to protect confidentiality and integrity of the secret messages b y distrib uting the message shares into several recipients. The secret message could not b e revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker ob tain shares shadow during the share exchange, it would b e impossible for the attacker to understand the correct share. There are few algorithms have b een developed for secret sharing, e.g. secret splittin g, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research ab out which method provides b est level of security and efficiency in securing message. In this paper, we evaluate the performance of three m ethods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces th e shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.

show abstract

Improved Multi-secret Sharing Scheme Based on One-Way Function

Cited by 2 publications

References 0 publications

"An Address Propagation Model in P2P and F2P Networks"

"An Address Propagation Model in P2P and F2P Networks"

Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual Cryptography for Security of Handwritten Images

Contact Info

Product

Resources

About