Sciweavers

1923 search results - page 193 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ACNS
2006
Springer
167views Cryptology» more  ACNS 2006»
15 years 1 months ago
Public Key Cryptography Sans Certificates in Ad Hoc Networks
Abstract. Several researchers have proposed the use of threshold cryptographic model to enable secure communication in ad hoc networks without the need of a trusted center. In this...
Nitesh Saxena
78
Voted
WPES
2003
ACM
15 years 3 months ago
Anonymous credentials with biometrically-enforced non-transferability
We present a model and protocol for anonymous credentials. Rather than using deterrents to ensure non-transferability, our model uses secure hardware with biometric authentication...
Russell Impagliazzo, Sara Miner More
TCS
2011
14 years 5 months ago
Smart PAC-learners
The PAC-learning model is distribution-independent in the sense that the learner must reach a learning goal with a limited number of labeled random examples without any prior know...
Malte Darnstädt, Hans-Ulrich Simon
ICPP
1991
IEEE
15 years 1 months ago
Two Techniques to Enhance the Performance of Memory Consistency Models
The memory consistency model supported by a multiprocessor directly affects its performance. Thus, several attempts have been made to relax the consistency models to allow for mor...
Kourosh Gharachorloo, Anoop Gupta, John L. Henness...
JCP
2008
216views more  JCP 2008»
14 years 10 months ago
Direct Anonymous Attestation for Next Generation TPM
Trusted computing platforms have been proposed as a promising approach to enhance the security of general-purpose computing systems. Direct Anonymous Attestation(DAA) is a scheme t...
Xiaofeng Chen 0004, Dengguo Feng