Secret sharing over infinite domains

DOI10.1007/BF02620136zbMath0774.94003MaRDI QIDQ1261017

Eyal Kushilevitz, Benny Chor

Publication date: 29 August 1993

Published in: Journal of Cryptology (Search for Journal in Brave)

zbMATH Keywords

secret-sharingperfect private-key encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Secret-sharing schemes for very dense graphs, Measuring, simulating and exploiting the head concavity phenomenon in BKZ, On the Impossibility of Strong Encryption Over $\aleph_0$, How to recover a secret with \(O(n)\) additions, Ideal uniform multipartite secret sharing schemes, Optimal linear multiparty conditional disclosure of secrets protocols, Secret-Sharing Schemes: A Survey, On Hiding a Plaintext Length by Preencryption, Language Modeling and Encryption on Packet Switched Networks, Matroids Can Be Far from Ideal Secret Sharing, Secret Sharing Schemes for Dense Forbidden Graphs, An impossibility result on graph secret sharing, Efficient explicit constructions of compartmented secret sharing schemes

Cites Work

• On hiding information from an oracle
• How to share a secret
• Communication Theory of Secrecy Systems*
• A Combinatorial Approach to Threshold Schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item