1064 search results - page 83 / 213 » Cryptography from Anonymity |
118
Voted
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
121
Voted
FSTTCS
2003
Springer
15 years 9 months ago
2003
Springer
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
103
Voted
CIE
2008
Springer
15 years 5 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
127
Voted
FSE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
138
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility o...