An Unequal Probability Scheme for Improving Anonymity in Shared Key Operations
Tóm tắt
We propose a new unequal probability scheme for shared key operations. It is seen that this scheme improves upon the values of anonymity measures, as quantified via appropriate conditional probabilities, over the existing ones, which are based on equal probability selection.
Tài liệu tham khảo
Fuller, W. A. 2009. Sampling statistics. Hoboken, NJ: John Wiley.
Lahiri, D. B. 1951. A method of sample selection providing unbiased ratio estimates. Bull. Int. Statist. Inst., 33, 133–146.
Long S., J. Pieprzyk, H. Wang, and D. S. Wong. 2006. Generalized cumulative arrays in secret sharing. Desig. Codes Cryptogr., 40, 191–209.
Martin, K. M., and S.-L. Ng. 2007. The combinatorics of generalized cumulative arrays. J. Math. Cryptol., 1, 13–32.
Tille, Y. 2006. Sampling algorithms. New York, NY: Springer-Verlag.
Walker, R. A. II. 2012. PHFtables.com. www.phftables.com (accessed January 2012).
Zaverucha, G. M., and D. G. Stinson. 2010. Anonymity in shared symmetric key primitives. Desig. Codes Cryptogr., 57, 139–160.