5476 search results - page 315 / 1096 » Resettably Secure Computation |
172
click to vote
LICS
2006
IEEE
16 years 23 days ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
174
click to vote
JAMIA
2011
14 years 9 months ago
2011
Background Providers have been reluctant to disclose patient data for public-health purposes. Even if patient privacy is ensured, the desire to protect provider confidentiality h...
158
click to vote
SIGITE
2005
ACM
16 years 10 days ago
2005
ACM
In this paper we present the context of the work of the Curriculum Committee on IT2005, the IT curriculum volume described in the Overview Draft document of the Joint Task Force f...
172
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
220
click to vote
SASN
2003
ACM
16 years 16 hour ago
2003
ACM
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...