scispace - formally typeset
Search or ask a question

Showing papers on "Secret sharing published in 1990"


Book ChapterDOI
01 Feb 1990
TL;DR: This paper will present general methods for constructing secret sharing schemes for any given secret sharing function using the set of monotone functions and tools developed for simplifying the latter set can be applied equally well to the former set.
Abstract: Secret Sharing from the perspective of threshold schemes has been well-studied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form. For example, if it is desirable to divide a secret among four participants A, B, C, and D in such a way that either A together with B can reconstruct the secret or C together with D can reconstruct the secret, then threshold schemes (even with weighting) are provably insufficient.This paper will present general methods for constructing secret sharing schemes for any given secret sharing function. There is a natural correspondence between the set of "generalized" secret sharing functions and the set of monotone functions, and tools developed for simplifying the latter set can be applied equally well to the former set.

731 citations


Book ChapterDOI
01 Nov 1990
TL;DR: This paper constructs ideal secret sharing schemes for more general access structures which include the multilevel and compartmented access structures proposed by Simmons.
Abstract: In a secret sharing scheme, a dealer has a secret. The dealer gives each participant in the scheme a share of the secret. There is a set Γ of subsets of the participants with the property that any subset of participants that is in Γ can determine the secret. In a perfect secret sharing scheme, any subset of participants that is not in Γ cannot obtain any information about the secret. We will say that a perfect secret sharing scheme is ideal if all of the shares are from the same domain as the secret. Shamir and Blakley constructed ideal threshold schemes, and Benaloh has constructed other ideal secret sharing schemes. In this paper, we construct ideal secret sharing schemes for more general access structures which include the multilevel and compartmented access structures proposed by Simmons.

537 citations



Book ChapterDOI
11 Aug 1990
TL;DR: To obtain security, one needs to utilize many resources, among these are one-way functions, physically secure communication channels, and —though less well known— broadcasting.
Abstract: To obtain security, one needs to utilize many resources Among these are one-way functions, physically secure communication channels, and —though less well known— broadcasting

21 citations


Journal Article
TL;DR: In this paper, the authors proposed a zero-knowledge proof for cryptosystems, which can be argued in perfect zero knowledge in a bounded number of rounds in the presence of a fixed number of signatures.
Abstract: Public-key cryptosystems.- The Adolescence of Public-Key Cryptography.- A Secure Public-Key Authentication Scheme.- How to improve signature schemes.- A Generalization of El Gamal's Public Key Cryptosystem.- An Identity-Based Key-Exchange Protocol.- How to Keep Authenticity Alive in a Computer Network.- The Use of Fractions in Public-Key Cryptosystems.- A Practical Protocol for Large Group Oriented Networks.- Theory.- Counting Functions Satisfying a Higher Order Strict Avalanche Criterion.- A Key Distribution System Based On Any One-Way Function.- Non-linearity of Exponent Permutations.- Informational Divergence Bounds for Authentication Codes.- 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms.- A Simple Technique for Diffusing Cryptoperiods.- Zero-knowledge protocols.- A General Zero-Knowledge Scheme.- Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility.- Verifiable Disclosure of Secrets and Applications (Abstract).- Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.- An alternative to the Fiat-Shamir protocol.- Sorting out zero-knowledge.- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds.- Zero-Knowledge Proofs of Computational Power.- More Efficient Match-Making and Satisfiability The Five Card Trick.- Applications.- A Single Chip 1024 Bits RSA Processor.- Cryptel - The Practical Protection of an Existing Electronic Mail System.- Technical Security: The Starting Point.- Security in Open Distributed Processing.- A European Call for Cryptographic Algorithms: Ripe Race Integrity Primitives Evaluation.- Signature and untraceability.- Legal Requirements Facing New Signature Technology.- Online Cash Checks.- Efficient Offline Electronic Checks.- Unconditional Sender and Recipient Untraceability in Spite of Active Attacks.- Detection of Disrupters in the DC Protocol.- Cryptanalysis.- Random Mapping Statistics.- Factoring by electronic mail.- Cryptanalysis of Short RSA Secret Exponents.- How to Break the Direct RSA-Implementation of Mixes.- An Information-Theoretic Treatment of Homophonic Substitution.- Cryptanalysis of a Modified Rotor Machine.- Cryptanalysis of Video Encryption Based on Space-Filling Curves.- Impossibility and Optimality Results on Constructing Pseudorandom Permutations.- On the Security of Schnorr's Pseudo Random Generator.- How easy is collision search? Application to DES.- Sharing and authentication schemes.- Prepositioned Shared Secret and/or Shared Control Schemes.- Some Ideal Secret Sharing Schemes.- Cartesian Authentication Schemes.- How to Say "No".- Key Minimal Authentication Systems for Unconditional Secrecy.- Sequences.- Parallel Generation of Recurring Sequences.- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point.- On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can't be Random.- Feedforward Functions Defined by de Bruijn Sequences.- Nonlinearity Criteria for Cryptographic Functions.- On the Linear Complexity of Feedback Registers.- Linear Complexity Profiles and Continued Fractions.- A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences.- Algorithms.- On the Complexity and Efficiency of a New Key Exchange System.- A New Multiple Key Cipher and an Improved Voting Scheme.- Atkin's Test: News from the Front.- Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity.- Old problems.- Deciphering Bronze Age Scripts of Crete The Case of Linear A.- Rump Session (impromptu talks).- Faster Primality Testing.- Private-Key Algebraic-Code Cryptosystems with High Information Rates.- Zero-knowledge procedures for confidential access to medical records.- Full Secure Key Exchange and Authentication with no Previously Shared Secrets.- Varying Feedback Shift Registers.- A Cryptanalysis of Stepk,m-Cascades.- Efficient Identification and Signatures for Smart Cards.- The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability.- Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences.- On the Design of Permutation P in des Type Cryptosystems.- A Fast Elliptic Curve Cryptosystem.

12 citations


Journal ArticleDOI
TL;DR: Sodot as discussed by the authors described secret sharing as a social form among Israeli children as a form of secret sharing among children and used it to teach language and social interaction in their children.
Abstract: (1990) Sodot: Secret‐sharing as a social form among Israeli children Research on Language and Social Interaction: Vol 24, No 1-4, pp 141-157

6 citations


Journal ArticleDOI
TL;DR: It is shown here that this is necessarily the case when latin squares are used and that all the secret-sharing systems known at the time his book was written can be described in terms of Reed-Solomon codes.
Abstract: In a recent book (Elements of Digital Satellite Communication, vol.II, 1985), W.W. Wu has shown that all the secret-sharing systems known at the time his book was written can be described in terms of Reed-Solomon codes. He has also remarked that all are connected with latin squares and has illustrated this remark by means of examples. However, his examples construct secret-sharing systems in which the secret can be unlocked with only two keys. It is shown here that this is necessarily the case when latin squares are used. For this purpose. Wu's observations are replaced by a theorem, one which also shows a connection with Golomb-Posner codes. >

2 citations


01 Jan 1990
TL;DR: A perfect extrinsic secret sharing scheme is constructed for any case in which a set of participants can gain access to the secret if and only if the set contains a pair of members from some given list of pairs.
Abstract: We construct a perfect extrinsic secret sharing scheme for any case in which a set of participants can gain access to the secret if and only if the set contains a pair of members from some given list of pairs. A secret sharing scheme is a way by which a dealer rnay distribute secret information to individuals (call participants). There is associated '-

1 citations