Sciweavers

570 search results - page 16 / 114
» Black-box constructions for secure computation
Sort
View
IJNSEC
2008
88views more  IJNSEC 2008»
13 years 7 months ago
Security Requirements for RFID Computing Systems
Many security and privacy protocols for RFID systems have been proposed [8, 13, 19, 20]. In most cases these protocols are evaluated in terms of security based on some model. Ofte...
Xiaolan Zhang 0003, Brian King
ACISP
2006
Springer
13 years 11 months ago
Efficient and Provably Secure Multi-receiver Identity-Based Signcryption
In this paper, we propose an efficient multi-receiver identity based signcryption scheme which only needs one pairing computation to signcrypt a message for n receivers and can pro...
Shanshan Duan, Zhenfu Cao
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
ICALP
2005
Springer
14 years 1 months ago
Single-Key AIL-MACs from Any FIL-MAC
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
Ueli M. Maurer, Johan Sjödin
CCS
2005
ACM
14 years 1 months ago
Towards computationally sound symbolic analysis of key exchange protocols
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
Prateek Gupta, Vitaly Shmatikov