Sciweavers

27 search results - page 5 / 6
» Randomizing RFID Private Authentication
Sort
View
FOCS
2005
IEEE
13 years 11 months ago
The Complexity of Online Memory Checking
We consider the problem of storing a large file on a remote and unreliable server. To verify that the file has not been corrupted, a user could store a small private (randomized...
Moni Naor, Guy N. Rothblum
CN
2007
137views more  CN 2007»
13 years 5 months ago
AID: A global anti-DoS service
Distributed denial of service (DDoS) has long been an open security problem of the Internet. Most proposed solutions require the upgrade of routers across the Internet, which is e...
Shigang Chen, Yibei Ling, Randy Chow, Ye Xia
ASIACRYPT
2008
Springer
13 years 7 months ago
Compact Proofs of Retrievability
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...
Hovav Shacham, Brent Waters
CCS
2008
ACM
13 years 7 months ago
Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
Alfred Menezes, Berkant Ustaoglu
PROVSEC
2010
Springer
13 years 3 months ago
Identity Based Public Verifiable Signcryption Scheme
Abstract. Signcryption as a single cryptographic primitive offers both confidentiality and authentication simultaneously. Generally in signcryption schemes, the message is hidden a...
S. Sharmila Deva Selvi, S. Sree Vivek, C. Pandu Ra...