Sciweavers

255 search results - page 47 / 51
» Security of Encryption Schemes in Weakened Random Oracle Mod...
Sort
View
TIT
2008
187views more  TIT 2008»
13 years 7 months ago
The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
Abstract--In the bounded-storage model (BSM) for information-theoretic secure encryption and key agreement, one makes use of a random string R whose length t is greater than the as...
Stefan Dziembowski, Ueli M. Maurer
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 1 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
CCS
2004
ACM
14 years 26 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
ICICS
2005
Springer
14 years 1 months ago
Generic Construction of (Identity-Based) Perfect Concurrent Signatures
The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson. In concurrent signature schemes, two entities can produce two signatures that are not bindi...
Sherman S. M. Chow, Willy Susilo
JCP
2008
216views more  JCP 2008»
13 years 7 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