2601 search results - page 150 / 521 » Secure Rewarding Schemes |
135
click to vote
ACISP
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
162
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Recently, distributed data storage has gained increasing popularity for efficient and robust data management in wireless sensor networks (WSNs). But the distributed arc...
112
Voted
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— An important issue in mobile commerce (mcommerce) is to exchange digital data between two distributed parties in an efficient and fair manner. In this paper, a lightwe...
138
click to vote
SISW
2005
IEEE
15 years 8 months ago
2005
IEEE
A crucial element of distributed cryptographic file systems are key management solutions that allow for flexible but secure data sharing. We consider efficient key management s...
131
click to vote
ASIACRYPT
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...