Sciweavers

686 search results - page 107 / 138
» Secure Two-Party Computation Is Practical
Sort
View
FC
2006
Springer
139views Cryptology» more  FC 2006»
14 years 2 months ago
Defeating Malicious Servers in a Blind Signatures Based Voting System
In this paper, we present two failures in the blind signatures based voting system Votopia [2] which has been tested during the last World Soccer Cup. We then propose a fix which r...
Sébastien Canard, Matthieu Gaud, Jacques Tr...
DLOG
2010
13 years 9 months ago
Correcting Access Restrictions to a Consequence
Recent research has shown that annotations are useful for representing access restrictions to the axioms of an ontology and their implicit consequences. Previous work focused on co...
Martin Knechtel, Rafael Peñaloza
ICALP
2005
Springer
14 years 4 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
CCS
2001
ACM
14 years 3 months ago
A Cryptanalysis of the High-Bandwidth Digital Content Protection System
Abstract. We describe a weakness in the High Bandwidth Digital Content Protection (HDCP) scheme which may lead to practical attacks. HDCP is a proposed identity-based cryptosystem ...
Scott Crosby, Ian Goldberg, Robert Johnson, Dawn X...
FC
2000
Springer
150views Cryptology» more  FC 2000»
14 years 2 months ago
Self-Scrambling Anonymizers
For the two last decades, people have tried to provide practical electronic cash schemes, with more or less success. Indeed, the most secure ones generally suffer from inefficiency...
David Pointcheval