Sciweavers

298 search results - page 43 / 60
» Strong Anonymous Signatures
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer
DBSEC
1998
115views Database» more  DBSEC 1998»
13 years 8 months ago
Secure Mediation: Requirements and Design
In this paper1 we discuss the security requirements for mediation, and present our approach towards satisfying them, with an emphasis on con dentiality and authenticity. Furthermo...
Joachim Biskup, Ulrich Flegel, Yücel Karabulu...
OPODIS
2010
13 years 5 months ago
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
Achour Mostéfaoui, Michel Raynal
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
13 years 9 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
ASIACRYPT
2001
Springer
13 years 11 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois