Sciweavers

222 search results - page 39 / 45
» How to Forget a Secret
Sort
View
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
15 years 5 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung
HICSS
2010
IEEE
225views Biometrics» more  HICSS 2010»
15 years 4 months ago
A Comparative Analysis of Professional Forums in the United States Army and Hybrid Communities of Practice in the Civilian Secto
Communities of practice (COPs) have been around since the founding of the first social networks many millennia ago. Organizations around the world over the last two decades have l...
Jon Brickey, Steven Walczak
NDSS
2008
IEEE
15 years 4 months ago
Corrupted DNS Resolution Paths: The Rise of a Malicious Resolution Authority
We study and document an important development in how attackers are using Internet resources: the creation of malicious DNS resolution paths. In this growing form of attack, victi...
David Dagon, Niels Provos, Christopher P. Lee, Wen...
ASIACRYPT
2007
Springer
15 years 4 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
DRM
2007
Springer
15 years 4 months ago
Slicing obfuscations: design, correctness, and evaluation
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
Anirban Majumdar, Stephen Drape, Clark D. Thombors...