Sciweavers

16518 search results - page 3109 / 3304
» A New Approach to Splitting-Off
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
16 years 7 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
ESORICS
2009
Springer
16 years 7 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
CCS
2009
ACM
16 years 7 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
CHI
2009
ACM
16 years 7 months ago
Two studies of opportunistic programming: interleaving web foraging, learning, and writing code
This paper investigates the role of online resources in problem solving. We look specifically at how programmers--an exemplar form of knowledge workers--opportunistically interlea...
Joel Brandt, Philip J. Guo, Joel Lewenstein, Mira ...
PPOPP
2009
ACM
16 years 7 months ago
Transactional memory with strong atomicity using off-the-shelf memory protection hardware
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
Martín Abadi, Tim Harris, Mojtaba Mehrara
« Prev « First page 3109 / 3304 Last » Next »