Sciweavers

9503 search results - page 205 / 1901
» Authenticated System Calls
Sort
View
GLOBECOM
2007
IEEE
16 years 1 months ago
Power-Modulated Challenge-Response Schemes for Verifying Location Claims
—Location information should be verifiable in order to support new computing and information services. In this paper, we adapt the classical challenge-response method for authen...
Yu Zhang, Zang Li, Wade Trappe
CCS
2004
ACM
16 years 17 days ago
Direct anonymous attestation
This paper describes the direct anonymous attestation scheme (DAA). This scheme was adopted by the Trusted Computing Group as the method for remote authentication of a hardware mo...
Ernest F. Brickell, Jan Camenisch, Liqun Chen
PKC
2004
Springer
195views Cryptology» more  PKC 2004»
16 years 16 days ago
An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications
Abstract. Bellare, Boldyreva, Desai, and Pointcheval [1] recently proposed a new security requirement of the encryption schemes called “keyprivacy.” It asks that the encryption...
Ryotaro Hayashi, Tatsuaki Okamoto, Keisuke Tanaka
ACSAC
2004
IEEE
15 years 11 months ago
PEACE: A Policy-Based Establishment of Ad-hoc Communities
Ad-hoc networks are perceived as communities of autonomous devices that interconnect with each other. Typically, they have dynamic topologies and cannot rely on a continuous conne...
Sye Loong Keoh, Emil Lupu, Morris Sloman
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 11 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo