Secret sets and applications
From MaRDI portal
Publication:293178
DOI10.1016/S0020-0190(97)80449-8zbMath1339.94054MaRDI QIDQ293178
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
Related Items (3)
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