Sciweavers

773 search results - page 21 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
ASIACRYPT
2011
Springer
12 years 9 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
CSFW
2010
IEEE
14 years 1 months ago
A Game-Based Definition of Coercion-Resistance and Its Applications
Coercion-resistance is one of the most important and intricate security requirements for voting protocols. Several definitions of coercion-resistance have posed in the literature,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
CSFW
2009
IEEE
14 years 4 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
ICALP
2005
Springer
14 years 3 months ago
Optimistic Asynchronous Atomic Broadcast
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...
Klaus Kursawe, Victor Shoup
IIWAS
2004
13 years 11 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
Fuw-Yi Yang, Jinn-ke Jan