Shared generation of pseudo-random functions
From MaRDI portal
Publication:1827581
DOI10.1016/J.JCO.2003.08.021zbMATH Open1058.94017OpenAlexW1964363905WikidataQ62559248 ScholiaQ62559248MaRDI QIDQ1827581FDOQ1827581
Authors: Huaxiong Wang, Josef Pieprzyk 
Publication date: 6 August 2004
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.021
Recommendations
cryptographysecret sharingaccess structurepseudo-random functionsset-cover problemcumulative mapsresilient collection of sets
Cites Work
- How to share a secret
- Multiple assignment scheme for sharing secret
- How to share a function securely
- One way functions and pseudorandom generators
- An explication of secret sharing schemes
- Security of Ramp Schemes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust threshold DSS signatures
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust and efficient sharing of RSA functions.
- Geometric secret sharing schemes and their duals
- How to break a practical MIX and design a new one
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributing the encryption and decryption of a block cipher
- Title not available (Why is that?)
- Advances in cryptology - ASIACRYPT 2002. 8th international conference on the theory and application of cryptology and information security, Queenstown, New Zealand, December 1--5, 2002. Proceedings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Shared generation of pseudo-random functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827581)
