• Corpus ID: 49314657

Authentication as a service: Shamir Secret Sharing with byzantine components

  title={Authentication as a service: Shamir Secret Sharing with byzantine components},
  author={Andrea Bissoli and Fabrizio d'Amore},
We present a practical methodology for securing the password-based authentication scheme. [] Key Method The scheme is information-theoretic secure. Since each of the n shares is stored on a different host (shareholder), an attacker will need to compromise k different shareholders for obtaining an amount of data sufficient for reconstructing the secret. Furthermore, in order to be resistant to the compromising of the server (dealer) coordinating the shareholders we define a variant of the classic Shamir…

Assessment of Two Privacy Preserving Authentication Methods Using Secure Multiparty Computation Based on Secret Sharing

A system for both password-based and iris-based authentication that uses secure multiparty computation (SMPC) protocols and Shamir secret sharing and can be successfully integrated in real-word authentication systems is proposed.

User Authentication using Secret Key Sharing

A system that performs two factor authentication with server for getting access to banking system and analyzes the security to check that in the practical applications all known security requirements are fulfilled, particularly the key exposure attack resistance.

AuSDiDe: Towards a New Authentication System for Distributed and Decentralized Structure based on Shamir’s Secret Sharing

The main objective of AuSDiDe is to securely store and manage passwords, private keys, and authentication based on the Shamir secret sharing algo-rithm, which significantly reinforces data protection in information security.

Decentralized and Privacy-Preserving Key Management Model

A decentralized system capable of performing key management operations including key generation, key backup, and key recovery, and the preliminary solution for a decentralized identity verification protocol is proposed.



Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing

It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons. Any k of these

Publicly Verifiable Secret Sharing

  • M. Stadler
  • Computer Science, Mathematics
  • 1996
Publicly verifiable secret sharing schemes are called, new applications to escrow cryptosystems and to payment systems with revocable anonymity are discussed, and two new realizations based on ElGamal's Cryptosystem are presented.

A practical scheme for non-interactive verifiable secret sharing

  • Paul Feldman
  • Computer Science
    28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
This paper presents an extremely efficient, non-interactive protocol for verifiable secret sharing, which provides asynchronous networks with a constant-round simulation of simultaneous broadcast networks whenever even a bare majority of processors are good.

Password-based authentication: a system perspective

A system model of the risks associated with password-based authentication is presented from a users centric point of view including the construct of user password memory aids and a preliminary analysis of the implications of this user centric interconnection of security models is presented.

Verifiable secret sharing and multiparty protocols with honest majority

A verifiable secret sharing protocol is presented, and it is shown that any multiparty protocol, or game with incomplete information, can be achieved if a majority of the players are honest.

How to Break MD5 and Other Hash Functions

A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.

Verifiable secret sharing and achieving simultaneity in the presence of faults

Verifiable secret sharing is a cryptographic protocol that allows one to break a secret in 11 pieccs and publicly distribute thcln to 11 people so that tile secret is reconstructible given only

How to share a secret

  • A. Shamir
  • Computer Science, Mathematics
  • 1979
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

Password-based authentication

The people who invented computer passwords obviously never met Charlie Fox, the postman in Hampton, Connecticut, who was a pleasant and perfectly normal fellow, but one who just couldn't remember a phone number, even his own.

A modular approach to key safeguarding

A method is proposed for a key safeguarding scheme in which the shadows are congruence classes of a number associated with the original key that provides efficient error detection and exposes deliberate tampering.