Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Secret sets and applications

From MaRDI portal
Publication:293178
Jump to:navigation, search

DOI10.1016/S0020-0190(97)80449-8zbMath1339.94054MaRDI QIDQ293178

Gene Tsudik, Refik 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


zbMATH Keywords

cryptographymobile networkslocation secrecysecret multicastsecret sets


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (3)

On secret set schemes ⋮ Multiple ramp schemes ⋮ Anonymous protocols: notions and equivalence



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The dining cryptographers problem: Unconditional sender and recipient untraceability
  • Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
  • An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information


This page was built for publication: Secret sets and applications

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:293178&oldid=12176203"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki