Sciweavers

3482 search results - page 668 / 697
» Designing for security
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 10 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
14 years 10 months ago
Natural throw and tilt interaction between mobile phones and distant displays
Raimund Dachselt University of Magdeburg Faculty of Computer Science User Interface & Software Engineering Group 39106 Magdeburg, Germany dachselt@acm.org Robert Buchholz Unive...
Raimund Dachselt, Robert Buchholz
CHI
2002
ACM
14 years 10 months ago
What makes people trust online gambling sites?
A validated model of trust was used as a framework for an empirical study to identify on- and offline factors that influence gamblers' perception of an online casino's t...
Bhiru Shelat, Florian N. Egger
STOC
2006
ACM
152views Algorithms» more  STOC 2006»
14 years 10 months ago
Private approximation of search problems
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
ICSE
2005
IEEE-ACM
14 years 10 months ago
Use of relative code churn measures to predict system defect density
Software systems evolve over time due to changes in requirements, optimization of code, fixes for security and reliability bugs etc. Code churn, which measures the changes made to...
Nachiappan Nagappan, Thomas Ball