Sciweavers

1612 search results - page 258 / 323
» About models of security protocols
Sort
View
IACR
2011
152views more  IACR 2011»
13 years 9 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
HOTOS
2003
IEEE
15 years 3 months ago
Flexible OS Support and Applications for Trusted Computing
Trusted computing (e.g. TCPA and Microsoft’s NextGeneration Secure Computing Base) has been one of the most talked about and least understood technologies in the computing commu...
Tal Garfinkel, Mendel Rosenblum, Dan Boneh
TRUST
2010
Springer
15 years 2 months ago
A Pairing-Based DAA Scheme Further Reducing TPM Resources
Direct Anonymous Attestation (DAA) is an anonymous signature scheme designed for anonymous attestation of a Trusted Platform Module (TPM) while preserving the privacy of the devic...
Ernie Brickell, Jiangtao Li
BPM
2007
Springer
258views Business» more  BPM 2007»
15 years 1 months ago
Access Control Requirements for Processing Electronic Health Records
There is currently a strong focus worldwide on the potential of large-scale Electronic Health Record systems to cut costs and improve patient outcomes through increased efficiency....
Bandar Alhaqbani, Colin J. Fidge
CRYPTO
2010
Springer
201views Cryptology» more  CRYPTO 2010»
14 years 11 months ago
Protecting Cryptographic Keys against Continual Leakage
Side-channel attacks have often proven to have a devastating effect on the security of cryptographic schemes. In this paper, we address the problem of storing cryptographic keys a...
Ali Juma, Yevgeniy Vahlis