1656 search results - page 201 / 332 » Secure Computation Without Authentication |
116
Voted
SASN
2003
ACM
15 years 6 months ago
2003
ACM
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...
87
Voted
WECWIS
2005
IEEE
15 years 6 months ago
2005
IEEE
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...
114
Voted
EUROCRYPT
2008
Springer
15 years 2 months ago
2008
Springer
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...
103
click to vote
PERCOM
2005
ACM
16 years 22 days ago
2005
ACM
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...
74
Voted
ICISC
2001
15 years 2 months ago
2001
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...