An Algorithm of Anonymous Id Assignment for Secure Data Sharing on a Network

Provided by: Creative Commons
Topic: Security
Format: PDF
Existing and new algorithms for assigning anonymous IDs are scrutinized with respect to tradeoffs among communication and computational requirements. An algorithm for distributed solution of certain polynomials over limited fields improves the scalability of the algorithms. Another form of anonymity as used in secure multiparty computation allows multiple parties on a network to together carry out a global computation that depends on data from each party while the data supposed by each party remains unknown to the other parties. The new algorithms are constructed on top of a secure sum data mining operation using Newton's identities and Sturm's theorem.

Find By Topic