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 145 for “"Secret Sharing"”.

  1. SECRET SHARING SCHEME

    Secret sharing is an important concept for implementing robust and secure computer systems. An access structure is a rule stipulating what combination or the participants (authorized set) can recover the secret and what combination (unauthorized set) can not. A secret sharing scheme (SSS in …

    nus Repository record for SECRET SHARING SCHEME (opens in a new tab) Download file for SECRET SHARING SCHEME (opens in a new tab)

  2. Exploiting Randomness in Secret Sharing

    Shamir's (k,n)-threshold scheme is a method for sharing a secret among n participants such that any group of k or more participants can recover the secret. Additionally, any group of participants with size less than k should learn nothing about the secret. The scheme works by distributing a share …

    clemson Repository record for Exploiting Randomness in Secret Sharing (opens in a new tab)

  3. Secret Sharing and Network Coding

    In this thesis, we consider secret sharing schemes and network coding. Both of these fields are vital in today's age as secret sharing schemes are currently being implemented by government agencies and private companies, and as network coding is continuously being used for IP networks. We begin …

    clemson Repository record for Secret Sharing and Network Coding (opens in a new tab)

  4. 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 …

    auckland-ms Repository record for Classification of Ideal Secret Sharing Schemes (opens in a new tab)

  5. Contextualizing Alternative Models of Secret Sharing

    A secret sharing scheme is a means of distributing information to a set of players such that any authorized subset of players can recover a secret and any unauthorized subset does not learn any information about the secret. In over forty years of research in secret sharing, there has been an …

    waterloo Repository record for Contextualizing Alternative Models of Secret Sharing (opens in a new tab)

  6. Secret sharing using artificial neural network

    Secret sharing is a fundamental notion for secure cryptographic design. In a secret sharing scheme, a set of participants shares a secret among them such that only pre-specified subsets of these shares can get together to recover the secret. This dissertation introduces a neural network approach to …

    tamu Repository record for Secret sharing using artificial neural network (opens in a new tab)

  7. Secret sharing schemes and noncommutative polynomial interpolation

    Secret sharing schemes and polynomial interpolation - their link is by now historic. This thesis uses and develops noncommutative models of interpolation and subsequently extends the original Shamir scheme of 1979 in several instances. Using first left-oriented quaternion polynomials, also present …

    manitoba Repository record for Secret sharing schemes and noncommutative polynomial interpolation (opens in a new tab)

  8. Secret Sharing Schemes and Advanced Encryption Standard

    … a simplified methodology to reconstruct a secret that is distributed using Shamir’s Secret Sharing Scheme, and to use the derived results to investigate implications on Advanced Encryption Standard. This thesis begins by using existing mathematical conjectures to simplify a monic polynomial …

    nps Repository record for Secret Sharing Schemes and Advanced Encryption Standard (opens in a new tab)

  9. 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 …

    auckland-ms Repository record for Simple Games with Applications to Secret Sharing Schemes (opens in a new tab)

  10. 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 …

    oviedo Repository record for On asymptotically good strongly multiplicative linear secret sharing (opens in a new tab)

  11. Finitely Iterated Rational Secret Sharing With Private Information

    … the problem of finitely iterated rational secret sharing. We describe how to evaluate this problem using game theory and finitely iterated prisoner’s dilemma. The players each have a private horizon that the other player does not know. The only thing that a player knows about their …

    uvic Repository record for Finitely Iterated Rational Secret Sharing With Private Information (opens in a new tab)

  12. Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography

    Secret Sharing refers to a method through which a secret key K can be shared among a group of authorized participants, such that when they come together later, they can figure out the secret key K to decrypt the encrypted message. Any group which is not authorized cannot determine the secret key K. …

    wku-diss Repository record for Efficient algorithm to construct phi function in vector space secret sharing scheme and application of secret sharing scheme in Visual Cryptography (opens in a new tab)

  13. Secret Sharing Approach for Securing Cloud-Based Image Processing

    … volume ray-casting by using Shamir?s (k, n) secret sharing and its variant (l, k, n) ramp secret sharing, which are homomorphic to addition and scalar multiplication operations, to hide volume data/images in datacenters. Firstly, we address the incompatibility issue of the floating point …

    nus Repository record for Secret Sharing Approach for Securing Cloud-Based Image Processing (opens in a new tab) Download file for Secret Sharing Approach for Securing Cloud-Based Image Processing (opens in a new tab)

  14. CONTINUOUS NON-MALLEABLE CODES AND NON-MALLEABLE SECRET SHARING

    … decoding. We also present a compiler that takes secret sharing schemes for an arbitrary access structures as input and produce non-malleable secret sharing schemes for the same access structure. Non-malleable secret sharing schemes guarantee that a secret that is reconstructed from a set of …

    nus Repository record for CONTINUOUS NON-MALLEABLE CODES AND NON-MALLEABLE SECRET SHARING (opens in a new tab) Download file for CONTINUOUS NON-MALLEABLE CODES AND NON-MALLEABLE SECRET SHARING (opens in a new tab)

  15. Novel Secret Sharing and Commitment Schemes for Cryptographic Applications

    In the second chapter, the notion of a social secret sharing (SSS) scheme is introduced in which shares are allocated based on a player's reputation and the way she interacts with other parties. In other words, this scheme renews shares at each cycle without changing the secret, and it allows the …

    waterloo Repository record for Novel Secret Sharing and Commitment Schemes for Cryptographic Applications (opens in a new tab)

  16. Multipartite Entanglement: Transformations, Quantum Secret Sharing, Quantum Error Correction

    … which can then be used to implement quantum secret sharing (QSS) schemes. We further prove the existence of AME states for any number of parties, if the dimension of the involved quantum systems is chosen appropriately. An equivalence between threshold QSS schemes and AME states shared …

    toronto-retro Repository record for Multipartite Entanglement: Transformations, Quantum Secret Sharing, Quantum Error Correction (opens in a new tab)

  17. 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 …

    umkc Repository record for Protected Secret Sharing and its Application to Threshold Cryptography (opens in a new tab)

Page 1 of 8