How to share a secret

DOI10.1145/359168.359176zbMath0414.94021WikidataQ21588915 ScholiaQ21588915MaRDI QIDQ3050283

Adi Shamir

Publication date: 1979

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/359168.359176

zbMATH Keywords

key management; cryptographic systems

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures, Veto is impossible in secret sharing schemes, Fully dynamic secret sharing schemes, Collisionful keyed hash functions with selectable collisions, Fair reconstruction of a secret, Password authentication without using a password table, On the information rate of secret sharing schemes, Lower bounds for monotone span programs, Linear secret sharing schemes and rearrangements of access structures, Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority, The design of a secure and fair sealed-bid auction service, Distributed ring signatures from general dual access structures, Generalised cumulative arrays in secret sharing, A flaw in the use of minimal defining sets for secret sharing schemes, Secret sharing schemes with partial broadcast channels, Reputation management and signature delegation: A distributed approach, A cheating prevention scheme for binary visual cryptography with homogeneous secret images, All inequalities for the relative entropy, VCPSS: A two-in-one two-decoding-options image sharing method combining visual cryptography (VC) and polynomial-style sharing (PSS) approaches, Partitioned encryption and achieving simultaneity by partitioning, How to share a secret with cheaters, Summing over a network without revealing summands, On the power of two-point based sampling, Secret sharing schemes for graph-based prohibited structures, Univariate polynomial factorization over finite fields, A cryptosystem for multiple communication, A note on Master keys for group sharing, On the classification of ideal secret sharing schemes, Distributed user identification by zero-knowledge access rights proving, Two distributed problems involving Byzantine processes, Protocols for group oriented secret sharing, Incidence structures applied to cryptography, Some improved bounds on the information rate of perfect secret sharing schemes, Strongly ideal secret sharing schemes, An explication of secret sharing schemes, Multiple assignment scheme for sharing secret, How to avoid the cheaters succeeding in the key sharing scheme, Secret sharing over infinite domains, Ideal homomorphic secret sharing schemes over cyclic groups, On the size of shares for secret sharing schemes, Geometric secret sharing schemes and their duals, On the structure of the privacy hierarchy, The knowledge complexity of quadratic residuosity languages, On dynamic threshold schemes, A note on dynamic threshold schemes, Anonymous secret sharing schemes, Sharing one secret vs. sharing many secrets., On identification secret sharing schemes., Multi-party key agreement protocols with cheater identification, Information flow on trees, Secure distributed storage and retrieval, Protecting data privacy in private information retrieval schemes, New efficient and secure protocols for verifiable signature sharing and other applications, Secret-sharing with a class of ternary codes, Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security, Probability of shares in secret sharing schemes, Weighted decomposition construction for perfect secret sharing schemes, On the bound for anonymous secret sharing schemes, Threshold undeniable signature scheme based on conic, New secret sharing scheme based on linear code, Improvement of Tseng et al.'s authenticated encryption scheme with message linkages, Secret sharing schemes with three or four minimal qualified subsets, An improvement on the Lin-Wu \((t,n)\) threshold verifiable multi-secret sharing scheme, On 2-level secret sharing, A perfect threshold secret sharing scheme to identify cheaters, A ramp model for distributed key distribution schemes, Generation of key predistribution schemes using secret sharing schemes, Randomness in secret sharing and visual cryptography schemes, A \((t,n)\) multi-secret sharing scheme, Threshold verification scheme to a valid-signature using identity only on specialized approval, Shared generation of pseudo-random functions, Kirkman packing designs KPD(\(\{w,s^{\ast}\},v \)) and related threshold schemes, The bank safe problem, Graph decompositions and secret sharing schemes, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure., Adaptively secure distributed public-key systems., A combinatorial characterization of regular anonymous perfect threshold schemes, Robust threshold DSS signatures, Some democratic secret sharing schemes, On the information rate of perfect secret sharing schemes, Authentication schemes, perfect local randomizers, perfect secrecy and secret sharing schemes, Mathematical problems in cryptology, An efficient construction of perfect secret sharing schemes for graph-based structures, Finite set theory and its application to cryptology, Recursive constructions for perfect secret sharing schemes, Secret sharing based on a hard-on-average problem, Two secret sharing schemes based on Boolean operations, Delegation with supervision, Threshold cryptography based on Asmuth-Bloom secret sharing, Secure distributed constraint satisfaction: reaching agreement without revealing private information, Certificateless threshold cryptosystem secure against chosen-ciphertext attack, Towards a theory of data entanglement, New \((t, n)\) threshold directed signature scheme with provable security, Bidirectional quantum secret sharing and secret splitting with polarized single photons, An efficient quantum secret sharing scheme with Einstein-Podolsky-Rosen pairs, New efficient and practical verifiable multi-secret sharing schemes, General constructions for information-theoretic private information retrieval, A scheme for threshold multi-secret sharing, A general approach to robust web metering, Properties and constraints of cheating-immune secret sharing schemes, Two phases encryption and its applications, Threshold Schemes Based on Criss-Cross Block Designs, A TACOMA retrospective, Bounds And Constructions For Threshold Shared Generation Of Authenticators, MANY-AGENT CONTROLLED MULTI-PLAYER QUANTUM SECRET SHARING SCHEME, Pollard's rho attack on ECDLP and Threshold Schemes, Efficient Simultaneous Broadcast, Public Key Broadcast Encryption with Low Number of Keys and Constant Decryption Time, Matroids Can Be Far from Ideal Secret Sharing, Cryptography and Game Theory: Designing Protocols for Exchanging Information, SuperTrust – A Secure and Efficient Framework for Handling Trust in Super Peer Networks, An efficient multi-round anonymous auction protocol, Secret Swarm Unit Reactive k −Secret Sharing, Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary, Threshold RSA for Dynamic and Ad-Hoc Groups, Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves, BASIC OPERATIONS AMONG ENTANGLED STATES AND THEIR APPLICATIONS TO QUANTUM PROTOCOLS, Unnamed Item, Escrow-free encryption supporting cryptographic workflow, Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security, Secret sharing schemes on access structures with intersection number equal to one, A dynamic threshold commercial key escrow scheme based on conic, Cheating in visual cryptography, A fuzzy vault scheme, Sharing multiple secrets: Models, schemes and analysis, Protecting against key-exposure: strongly key-insulated encryption with optimal threshold, Provably secure threshold password-authenticated key exchange, A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing, Identity based group-oriented undeniable signature scheme, A new efficient \((t,n)\) verifiable multi-secret sharing (VMSS) based on YCH scheme, Distributing the encryption and decryption of a block cipher, A secret sharing scheme based on cellular automata, An efficient quantum secret sharing protocol with orthogonal product states, On ASGS framework: general requirements and an example of implementation, A new password authentication mechanism based on two phases encryption, Several Generalizations of Shamir's Secret Sharing Scheme, How to share a secret, Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal, The accessibility of an access structure, Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability, Efficient and robust two-party RSA key generation, Signcryption-based key management for MANETs applications in mobile commerce, An efficient and secure multi-secret sharing scheme with general access structures, A threshold scheme under peer-to-peer network, Dynamic vector space secret sharing based on certificates, A trust scheme based DRM model for P2P system, An algebra to represent security policies for cryptography-based secure storage systems, How to Share Secrets: The Idea of Geometric Threshold Games, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Ideal multipartite secret sharing schemes
• Leakproof secret sharing protocols with applications to group identification scheme
• Three-level secret sharing schemes from the twisted cubic
• Ciphertext-policy hierarchical attribute-based encryption with short ciphertexts
• On the optimization of bipartite secret sharing schemes
• Hierarchical threshold secret sharing
• Ideal secret sharing schemes whose minimal qualified subsets have at most three participants
• Multipartite secret sharing by bivariate interpolation
• Monotone circuits for monotone weighted threshold functions
• On the classification of ideal secret sharing schemes
• An explication of secret sharing schemes
• On the size of shares for secret sharing schemes
• The size of a share must be large
• Weighted threshold secret sharing schemes
• On 2-level secret sharing
• Discrete polymatroids
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Secret sharing schemes with bipartite access structure
• Ideal secret sharing schemes with multipartite access structures
• Secret-Sharing Schemes: A Survey
• How to share a secret
• On secret sharing schemes, matroids and polymatroids
• Secret Sharing and Non-Shannon Information Inequalities
• Characterizing Ideal Weighted Threshold Secret Sharing
• On secret sharing systems
• Lifetime maximization routing with network coding in wireless multihop networks
• Rational secret sharing as extensive games
• Practical Direct Chosen Ciphertext Secure Key-Policy Attribute-Based Encryption with Public Ciphertext Test
• Ideal Hierarchical Secret Sharing Schemes
• Practical Distributed Signatures in the Standard Model
• Matroids Can Be Far from Ideal Secret Sharing
• Natural Generalizations of Threshold Secret Sharing
• Theory of Cryptography