Sciweavers

21 search results - page 4 / 5
» New notions of security: achieving universal composability w...
Sort
View
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 5 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth
CRYPTO
2010
Springer
171views Cryptology» more  CRYPTO 2010»
13 years 6 months ago
Credential Authenticated Identification and Key Exchange
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
Jan Camenisch, Nathalie Casati, Thomas Groß,...
CCS
2010
ACM
13 years 11 months ago
Attribute-based signature and its applications
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
Jin Li, Man Ho Au, Willy Susilo, Dongqing Xie, Kui...
IFIP
2009
Springer
13 years 2 months ago
Attack, Solution and Verification for Shared Authorisation Data in TCG TPM
The Trusted Platform Module (TPM) is a hardware chip designed to enable computers achieve greater security. Proof of possession of authorisation values known as authdata is require...
Liqun Chen, Mark Ryan
ESORICS
2004
Springer
13 years 10 months ago
Towards a Theory of Data Entanglement: (Extended Abstract)
d Abstract) James Aspnes , Joan Feigenbaum , Aleksandr Yampolskiy † , and Sheng Zhong ‡ Department of Computer Science, Yale University, New Haven CT 06520-8285, USA Abstract. ...
James Aspnes, Joan Feigenbaum, Aleksandr Yampolski...