A private online system for executing wills based on a secret sharing mechanism

Authors:
Chin-Ling Chen;Cheng-Chi Lee;Yuh-Min Tseng;Teng-Tai Chou
Affiliations:
Department of Computer Science and Information Engineering, Chaoyang University of Technology, 168, Jifeng E. Rd., Wufeng District, Taichung, 41349, TaiwanChina;Department of Library and Information Science, Fu Jen Catholic University, No. 510 Chung Cheng Rd, Hsin Chuang District, New Taipei City, 24205, TaiwanChina;Department of Mathematics, National Changhua University of Education, Chang-Hua, 500, TaiwanChina;Department of Computer Science and Information Engineering, Chaoyang University of Technology, 168, Jifeng E. Rd., Wufeng District, Taichung, 41349, TaiwanChina
Venue:
Security and Communication Networks
Year:
2012

Citing 19
Cited 0

How to share a secret with cheaters

Journal of Cryptology
An explication of secret sharing schemes

Designs, Codes and Cryptography
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Fair exchange with a semi-trusted third party (extended abstract)

Proceedings of the 4th ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption

ACM Transactions on Information and System Security (TISSEC)
How to share a secret

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Efficient Identity Based Signature Schemes Based on Pairings

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
RSA-OAEP Is Secure under the RSA Assumption

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
The Cramer-Shoup Strong-RSASignature Scheme Revisited

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A Mobile Ticket System Based on Personal Trusted Device

Wireless Personal Communications: An International Journal
A pairing SW implementation for Smart-Cards

Journal of Systems and Software
High Speed RSA Implementation Based on Modified Booth's Technique and Montgomery's Multiplication for FPGA Platform

CENICS '09 Proceedings of the 2009 Second International Conference on Advances in Circuits, Electronics and Micro-electronics
Design of a fair proxy raffle protocol on the Internet

Computer Standards & Interfaces
The exact security of digital signatures-how to sign with RSA and Rabin

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A fair non-repudiation protocol

SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
Implementing cryptographic pairings on smartcards

CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
Optimistic fair exchange of digital signatures

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Family quarrels over inheritance, although not new, have been featured prominently in the news in recent years. Thus, the issue of executing wills for the purpose of dividing inheritance is worth investigating. Acrimony caused by family disputes or distribution of inheritance has a negative impact on society. Thus, we seek to construct a method of constructing a secure and private escrow will. The concept of secret sharing was proposed by Shamir and Blakley in 1979. Our method seeks to alleviate problems associated with secret sharing. We divide secret S into n pieces and distribute those pieces to n specific objects. We call the n owners the shadows. We then reconstruct these shadows and retrieve the original main key. Our method functions on the basis of the secret sharing mechanism. The proposed scheme combines the convenience of the Internet with cryptology technologies to solve the security problems of the online wills. It not only reduces cost and improves performance, but also prevents family infighting. Copyright © 2011 John Wiley & Sons, Ltd.