Shamir Threshold Based Encryption

Xiao Ying Gan; Bin Liu

doi:10.4028/www.scientific.net/AMM.52-54.709

Paper Titles

The Structure Design of Electromagnetic Clutch in the Adverse Circumstances
p.686

Honeycomb Paperboard Dynamic Properties Modeling and Parameters Estimation Using Free Response Data
p.692

Analysis of Pneumatic Vibration Isolator Considering Diaphragm Stiffness
p.698

Dynamic Mechanical Properties of Steel Fiber-Reinforced Concrete Subjected to Shock Loading
p.703

Shamir Threshold Based Encryption
p.709

Research of Trusted Network Security Technology
p.713

Free Vibration of a Cylindrical Shell with Varied Initial Stresses in Different Longitudinal Sections
p.717

Modal Analysis and Optimal Design of High-Speed Turning Center’s Spindle Box
p.723

Evaluating the Impact of Coarse Aggregate Content on Properties of Cement Treated Base
p.729

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 52-54Shamir Threshold Based Encryption

Shamir Threshold Based Encryption

Abstract:

This paper Shamir threshold scheme based on the protection of private keys, by constructing a Lagrange interpolating polynomial to achieve in the real environment using the key shared information systems, computation and communication in the case of less , the program can prevent the system key is lost, damaged, and from the enemy's attack, reduce the responsibility of the key holder, but also can reduce the success rate of an adversary to decipher the key. An example is the feasibility of the program.

You might also be interested in these eBooks

Advances in Mechanical Engineering (ICME)

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 52-54)

Pages:

709-712

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.52-54.709

Citation:

Cite this paper

Online since:

March 2011

Authors:

Xiao Ying Gan, Bin Liu

Keywords:

Information Security, Key, Lagrange Interpolation, Sharmir Threshold

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] December J et al, Introducing Java, Java unleased, Ed. Prentice-Hall. Madrid, (1997), pp.3-19.

Google Scholar

[2] G.R. Blakley. Safeguarding Cryptographic Keys. Proceedings of the National Computer Conference, 1979, American Federation of Information Processing Societies, 48, 1979, PP. 313-317.

Google Scholar

[3] Harn L, Hsin W J and Mehta M. Authenticated Diffic-Hellman Key Agreement Protocol Using a Single Cryptographic Assumption, IEEE Proc. –Commun, Vol 152 (2005), pp.404-410.

DOI: 10.1049/ip-com:20041041

Google Scholar

[4] D Chaum, Hvan Antwerpen H. Undeniable signatures. Advances in Cryptology-CRYPTO'89 Proceedings, Springer-Verlag, (1999), pp.212-216.

DOI: 10.1007/0-387-34805-0_20

Google Scholar

[5] C Asmuth, J Bloom, A Modular approach to key safeguarding, IEEE Transactions on Infornation Theory, 29, (1983), pp.208-210.

DOI: 10.1109/tit.1983.1056651

Google Scholar

[6] L. de Moura and N. Bjorner, Z3: An Efficient SMT Solver, in Tools and Algorithms for the Construction and Analysis of Systems, (2008), pp.337-340.

DOI: 10.1007/978-3-540-78800-3_24

Google Scholar

[7] B. Dutertre and L. de Moura, A Fast Linear-Arithmetic Solver for DPLL(T), in Computer Aided Verification, (2006), pp.81-94.

DOI: 10.1007/11817963_11

Google Scholar