Sciweavers

1656 search results - page 201 / 332
» Secure Computation Without Authentication
Sort
View
SASN
2003
ACM
14 years 3 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
14 years 3 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
EUROCRYPT
2008
Springer
13 years 12 months ago
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe...
Kaoru Kurosawa, Kazuhiro Suzuki
PERCOM
2005
ACM
14 years 9 months ago
A Scalable and Provably Secure Hash-Based RFID Protocol
The biggest challenge for RFID technology is to provide benefits without threatening the privacy of consumers. Many solutions have been suggested but almost as many ways have been...
Gildas Avoine, Philippe Oechslin
ICISC
2001
98views Cryptology» more  ICISC 2001»
13 years 11 months ago
A Multi-signature Scheme with Signers' Intentions Secure against Active Attacks
In this paper, we propose a multi-signature scheme, in which each signer can express her intention associating with the message to be signed. Signers' intentions mean a kind o...
Kei Kawauchi, Hiroshi Minato, Atsuko Miyaji, Mitsu...