Universal calculation secret protection method capable of repeatedly using assumed names
A technology for privacy protection and pervasive computing, which is applied to public keys for secure communication, user identity/authority verification, electrical components, etc. It can solve problems such as users not being identified, and achieve the effect of small computing tasks and low interference
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0032] Below in conjunction with accompanying drawing and embodiment describe in detail:
[0033] 1. If figure 1 , the global pervasive computing environment 10 is divided into autonomous regions 20, and all autonomous regions 20 use the same pseudonym set S; in order to prevent too few pseudonyms in one region, when there are too many access users, the pseudonyms in the pseudonym set S are not enough Use, and prevent birthday paradox attack problem; The present invention adopts the summary value H (SHA-512) that SHA-512 algorithm outputs as pseudonym set, namely S=H (SHA-512). In an autonomous region, as long as there are users, the autonomous region will not only select a pseudonym for the user, but also randomly select a certain number of pseudonyms that do not correspond to any user, so as to ensure that the number of pseudonyms in the autonomous region reaches a threshold.
[0034] 2. If figure 2 , in an autonomous area 20, including an authentication server 21 and mul...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 