Sciweavers

8655 search results - page 453 / 1731
» Challenges for Trusted Computing
Sort
View
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
15 years 8 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
GD
2008
Springer
15 years 5 months ago
Graph Drawing for Security Visualization
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
Roberto Tamassia, Bernardo Palazzi, Charalampos Pa...
JOC
2008
86views more  JOC 2008»
15 years 4 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
ICTAC
2009
Springer
15 years 2 months ago
A First-Order Policy Language for History-Based Transaction Monitoring
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
Andreas Bauer 0002, Rajeev Goré, Alwen Tiu
TISSEC
2010
237views more  TISSEC 2010»
14 years 11 months ago
BLAC: Revoking Repeatedly Misbehaving Anonymous Users without Relying on TTPs
Several credential systems have been proposed in which users can authenticate to service providers anonymously. Since anonymity can give users the license to misbehave, some varia...
Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. ...