SlideServe
Menu
Preferences
© SlideServe · v2026

Enhancing Team Security with Secret Sharing: A Programmable Approach

theta avatar
8 slides · 241 Views · 80 likes · Aug 21, 2014

In collaborative environments where trust is lacking, ensuring secure access to shared resources is critical. We propose a secret sharing program that divides a password into multiple pieces, enabling team members to securely participate without compromising project integrity. The user inputs the key, selects a sharing method, and retrieves it by combining the necessary pieces. While the implementation in Eiffel posed challenges due to limited mathematical libraries, the program functions as intended, paving the way for future innovations such as enhanced finite field classes and third-party key verifiers.

Enhancing Team Security with Secret Sharing: A Programmable Approach - slide 1
01 / 8Enhancing Team Security with Secret Sharing: A Programmable Approach
1 / 17

Download Presentation

Enhancing Team Security with Secret Sharing: A Programmable Approach
An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

More Related Content

Presentation Transcript
  1. SCB – A Secret Sharing Program Brian M. Fleming Laurence T. Grant

  2. Problem Posed • Imagine a situation where you were on a team with a common goal, but you didn’t trust your team members. • This leads to problems. • To leave project unlocked, allows team members to cheat, and to lock with one password gives only one complete power.

  3. Solution • Create a program to divide the password (or key) into X-many pieces, so each group member has an equal share of the password. • Alternately, create a program which creates N pieces of the key, and only requires M to put it back together.

  4. Implementation • The user inputs the key (which can either be a 9 digit number for equal sharing, or a 3 digit number for (2, n) splitting), and chooses a mode. • The result is put into a corresponding text box. • To retrieve the key, you put the necessary pieces in the appropriate boxes, and choose the proper mode.

  5. Results • Program works as expected. • Implementation of the Secret Sharing (M,N) was made more difficult, and take more time, in Eiffel due to a lack of readily available advance math classes (e.g.. – classes which can solve matrices in finite prime fields).

  6. Laurence Handled most of the behind the scenes math (e.g. – “math major stuff”). Got external graphics to display in the program. Brian Built GUI. Handled manipulating input strings from user. Built menu system, help and about boxes. Division of Work

  7. The Future of SCB • Possible extensions include: • Writing a good, free, and available finite field class to handle larger numbers when using Secret Sharing (M,N) scheme. • Letting the secret number be entered by a trusted third party so it is unviewable by those who are receiving the pieces. • Allowing the output of more pieces.

  8. (Brief) References • Applied Cryptography, Bruce Schneier; John Wiley & Sons, Inc., 1996. • “How to Share a Secret”, Ami Shamir; Communications of the ACM, vol. 24, no. 11, 1979. • Introductory Modern Algebra, Saul Stahl; John Wiley & Sons, Inc., 1997. • See paper for rest . . .