Sciweavers

23630 search results - page 4603 / 4726
» Common Information Model
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 4 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
CHI
2009
ACM
16 years 4 months ago
A personalized walk through the museum: the CHIP interactive tour guide
More and more museums aim at enhancing their visitors' museum experiences in a personalized, intensive and engaging way inside the museum. The CHIP1 (Cultural Heritage Inform...
Ivo Roes, Natalia Stash, Yiwen Wang, Lora Aroyo
SIGCSE
2009
ACM
139views Education» more  SIGCSE 2009»
16 years 4 months ago
Abstraction and extensibility in digital logic simulation software
ion and Extensibility in Digital Logic Simulation Software Richard M. Salter and John L. Donaldson Computer Science Department Oberlin College Oberlin, OH 44074 rms@cs.oberlin.edu,...
Richard M. Salter, John L. Donaldson
PODC
2009
ACM
16 years 4 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
PKC
2009
Springer
172views Cryptology» more  PKC 2009»
16 years 4 months ago
CCA-Secure Proxy Re-encryption without Pairings
ded abstract of this paper appears in PKC 2009, S. Jarecki, G. Tsudik (Eds.), volume 5443 of LNCS, pp. 357-376, Sringer-Verlag, 2009. CCA-Secure Proxy Re-Encryption without Pairing...
Jun Shao, Zhenfu Cao
« Prev « First page 4603 / 4726 Last » Next »