Sciweavers

250 search results - page 31 / 50
» A Round and Communication Efficient Secure Ranking Protocol
Sort
View
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 5 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
WWW
2005
ACM
14 years 8 months ago
An abuse-free fair contract signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang
CCS
2009
ACM
13 years 5 months ago
RFID privacy: relation between two notions, minimal condition, and efficient construction
Privacy of RFID systems is receiving increasing attention in the RFID community. Basically, there are two kinds of RFID privacy notions: one based on the indistinguishability of t...
Changshe Ma, Yingjiu Li, Robert H. Deng, Tieyan Li
IJACT
2008
64views more  IJACT 2008»
13 years 8 months ago
An efficient one-move Nominative Signature scheme
Abstract. A signer in a Nominative Signature (NS) scheme can arbitrarily choose a nominee, then jointly generate a signature in such a way that the signature can only be verified w...
Qiong Huang, Dennis Y. W. Liu, Duncan S. Wong
ACSAC
2007
IEEE
13 years 12 months ago
Efficient Distributed Detection of Node Replication Attacks in Sensor Networks
Wireless sensor nodes lack hardware support for tamperresistance and are often deployed in unattended environments, thus leaving them vulnerable to capture and compromise by an ad...
Bo Zhu, Venkata Gopala Krishna Addada, Sanjeev Set...