Secret sets and applications

DOI10.1016/S0020-0190(97)80449-8zbMATH Open1339.94054MaRDI QIDQ293178FDOQ293178

Authors: G. Tsudik, R. Molva 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019097804498?np=y

Recommendations

• On secret set schemes
• Secret sharing schemes with applications in security protocols
• Secure set algorithms and complexity
• An Independence Relation for Sets of Secrets
• An independence relation for sets of secrets
• Finite set theory and its application to cryptology
• Secret Sharing Schemes with Algebraic Properties and Applications
• Complexity of secure sets
• Complexity of secure sets

zbMATH Keywords

cryptographylocation secrecymobile networkssecret multicastsecret sets

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Title not available (Why is that?)
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Set signatures and their applications
• On secret set schemes
• Anonymous protocols: notions and equivalence
• An independence relation for sets of secrets
• Title not available (Why is that?)
• Multiple ramp schemes

This page was built for publication: Secret sets and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293178)