Sciweavers

133 search results - page 11 / 27
» Towards a Game Theoretic View of Secure Computation
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Towards Sharp Inapproximability For Any 2-CSP
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
Per Austrin
ICALP
2005
Springer
14 years 1 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
GI
2004
Springer
14 years 1 months ago
Olympic Run
: Most game interfaces restrict the player to a place in front of the computer screen. In mixed reality applications the point of interaction seems to be moving away from technical...
Martin Faust, Daniel Cermak-Sassenrath
WETICE
2003
IEEE
14 years 1 months ago
Attack-Resistance of Computational Trust Models
The World Wide Web encourages widely-distributed, open, decentralised systems that span multiple administrative domains. Recent research has turned to trust management [4] as a fr...
Andrew Twigg, Nathan Dimmock
NDSS
2000
IEEE
14 years 8 days ago
A First Step Towards the Automatic Generation of Security Protocols
This paper describes automatic protocol generation (APG for short), a novel mechanism to generate security protocols automatically. With APG, the protocol designer inputs the spec...
Adrian Perrig, Dawn Xiaodong Song