Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 45 for “"secret sharing"”.
-
Rational secret sharing
… A keystone functionality used in cryptography is Secret Sharing. While there are several well known, efficient protocols that implement Secret Sharing in the Cryptographic model, designing a Rational Secret Sharing protocol which works in the Game Theoretic model has proved challenging. In this …
-
Mobile Proactive secret sharing
This thesis describes mobile proactive secret sharing (MPSS), an extension of proactive secret sharing. Mobile proactive secret sharing is much more flexible than proactive secret sharing in terms of group membership: instead of the group of shareholders being exactly the same from one epoch to the …
-
Practical Mobile Proactive Secret Sharing
Secret sharing schemes are needed to store and protect secrets in large scale distributed systems. These schemes protect a secret by dividing the it into shares and distributing the shares to multiple shareholders. This way the compromise of a single shareholder does not reveal the secret. Many new …
-
Breaking barriers in secret sharing
In this thesis, we study secret sharing schemes for general (non-threshold) access functions. In a secret sharing scheme for n parties associated to a monotone function [mathematical formula], a dealer distributes shares of a secret among n parties. Any subset of parties [mathematical formula] can …
-
Classification of Ideal Secret Sharing Schemes
Secret sharing schemes were introduced independently by Shamir and Blakley in 1979 and are now widely used in many cryptographic protocols. They are ideal for storing information that is highly sensitive and highly important. In a secret sharing scheme, each user is given a piece of information …
-
A study of efficient secret sharing
… (SZK) proof systems and (unconditionally secure) secret sharing schemes. Viewed through the SZK lens, we obtain several new results on secret-sharing: " Characterizations: We obtain an almost-characterization of access structures for which there are secret-sharing schemes with an efficient sharing …
-
Proactive secret sharing and public key cryptosystems
Thesis (S.B. and S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
Theory and practice of verifiable secret sharing
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
-
One Time Password Scheme Via Secret Sharing Techniques
… system called Shamir-OTP that is based upon secret sharing techniques.
-
On asymptotically good strongly multiplicative linear secret sharing
… de familias de esquemas de compartición de secretos lineales e ideales con multiplicación fuerte. Además, como aplicación de algunas técnicas que introducimos para estudiar dicho problema, se estudia la complejidad asintótica de ciertos algoritmos para multiplicar elementos de extensiones …
-
Simple Games with Applications to Secret Sharing Schemes
… open problem in a branch of cryptography called secret sharing schemes. Secret sharing schemes were first introduced by Shamir (1979) and now widely used in many cryptographic protocols as a tool for securely storing information that is highly sensitive and highly important. Such information …
-
Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography
<p>Secret Sharing refers to a method through which a secret key <em>K</em> can be shared among a group of authorized participants, such that when they come together later, they can figure out the secret key <em>K</em> to decrypt the encrypted message. Any group which is not authorized cannot …
-
Protected Secret Sharing and its Application to Threshold Cryptography
In the secret reconstruction of Shamir’s (t,n) secret sharing scheme (SS), shares released by shareholders need to be protected otherwise, non-shareholders can also obtain the secret. Key establishment protocol can establish pairwise keys for any pair of shareholders. Then, shareholders can use …
-
Concretely-Efficient Multi-Key Homomorphic Secret Sharing and Applications
Homomorphic secret sharing (HSS) is a powerful cryptographic primitive that enables efficient, low-communication secure computation without the use of fully homomorphic encryption. Public-key HSS is a well-known variant that supports inputs from multiple parties, but all parties must agree on a …
-
On foundations of public-key encryption and secret sharing
… information-theoretic notions of security in secret sharing, multiparty computation and statistical zero knowledge; and by providing a large toolbox used extensively in cryptography. This thesis addresses two questions in this realm: Leakage Resilience of Secret Sharing Schemes. We show that …
-
Improved Bounds for Codes and Secret Sharing Schemes from Algebraic Curves
… constructions of error-correcting codes and secret sharing schemes. For both objects we define parameters that indicate their effectiveness in applications. We explore infeasibility bounds, showing that objects with relatively high parameters cannot exist. The best upper bounds in the theory …
-
Thresholdizing lattice based encryption schemes
… we examine a variety of constructions based on secret sharing techniques applied on lattice-based cryptographic primitives constructed from the learning with erros (LWE) assumption. Using secret sharing techniques from [BGG⁺17], we show how to construct paradigms of threshold multi-key fully …
-
Cryptography and Computer Communications Security. Extending the Human Security Perimeter through a Web of Trust
This work modifies Shamir’s algorithm by sharing a random key that is used to lock up the secret data; as against sharing the data itself. This is significant in cloud computing, especially with homomorphic encryption. Using web design, the resultant scheme practically globalises secret sharing …
-
Autentizované ustanovení klíče s podporou sdíleného tajemství
… Shamirova sdílení tajemnství" (ang. "Shamir’s Secret Sharing-based Authenticated Key Agreement", zkráceně ShSSAKA). Protokol je založený na principu AKA (autentizovaná domluva klíče), Schnorrově podpisu a rozšířen Paillierovým schématem pro možnost podílení se více zařízení na podpisu a …
Page 1 of 3