Sciweavers

CISC
2009
Springer
148views Cryptology» more  CISC 2009»
13 years 9 months ago
A DAA Scheme Requiring Less TPM Resources
Abstract. Direct anonymous attestation (DAA) is a special digital signature primitive, which provides a balance between signer authentication and privacy. One of the most interesti...
Liqun Chen
CANS
2009
Springer
276views Cryptology» more  CANS 2009»
13 years 9 months ago
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
Benoît Libert, Damien Vergnaud
AFRICACRYPT
2009
Springer
13 years 9 months ago
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large integer modular exponentiation, the core of public-ke...
Owen Harrison, John Waldron
ACNS
2009
Springer
147views Cryptology» more  ACNS 2009»
13 years 9 months ago
Construction of Threshold Public-Key Encryptions through Tag-Based Encryptions
In this paper, we propose a notion of threshold tag-based encryption schemes that simplifies the notion of threshold identity-based encryption schemes, and we show a conversion fro...
Seiko Arita, Koji Tsurudome
TCC
2010
Springer
133views Cryptology» more  TCC 2010»
13 years 9 months ago
On the Necessary and Sufficient Assumptions for UC Computation
Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
Ivan Damgård, Jesper Buus Nielsen, Claudio O...
TCC
2010
Springer
117views Cryptology» more  TCC 2010»
13 years 9 months ago
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
Rafail Ostrovsky, Omkant Pandey, Ivan Visconti
TCC
2010
Springer
121views Cryptology» more  TCC 2010»
13 years 9 months ago
An Efficient Parallel Repetition Theorem
Abstract. We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness e...
Johan Håstad, Rafael Pass, Douglas Wikstr&ou...
TCC
2010
Springer
141views Cryptology» more  TCC 2010»
13 years 9 months ago
Composition of Zero-Knowledge Proofs with Efficient Provers
We revisit the composability of different forms of zero-knowledge proofs when the honest prover strategy is restricted to be polynomial time (given an appropriate auxiliary input)...
Eleanor Birrell, Salil P. Vadhan
TCC
2010
Springer
119views Cryptology» more  TCC 2010»
13 years 9 months ago
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrish...
PAIRING
2010
Springer
149views Cryptology» more  PAIRING 2010»
13 years 9 months ago
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
Abstract. We discuss the relationship between ID-based key agreement protocols, certificateless encryption and ID-based key encapsulation mechanisms. In particular we show how in s...
Dario Fiore, Rosario Gennaro, Nigel P. Smart