Sciweavers

2601 search results - page 69 / 521
» Secure Rewarding Schemes
Sort
View
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
15 years 8 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
ASIACRYPT
2000
Springer
15 years 3 months ago
The Security of Chaffing and Winnowing
This paper takes a closer look at Rivest's chaffing-and-winnowing paradigm for data privacy. We begin with a definition which enables one to clearly determine whether a given ...
Mihir Bellare, Alexandra Boldyreva
IJNSEC
2011
128views more  IJNSEC 2011»
14 years 6 months ago
Certificateless Group Oriented Signature Secure Against Key Replacement Attack
Since Al-Riyami and Paterson presented certificateless cryptography, many certificateless schemes have been proposed for different purposes. In this paper, we present a certificate...
Chunbo Ma, Jun Ao
COMCOM
2006
103views more  COMCOM 2006»
14 years 12 months ago
Comparison of motivation-based cooperation mechanisms for hybrid wireless networks
Today's public Wireless LANs are restricted to hotspots. With the current technology, providers can only target a small audience and in turn charge high prices for their serv...
Attila Weyland, Thomas Staub, Torsten Braun
CARDIS
1998
Springer
103views Hardware» more  CARDIS 1998»
15 years 4 months ago
Secure Personalization Using Proxy Cryptography
In this paper we describe new secure personalization schemes using proxy cryptography. We first introduce the context of a large scale smart card application such as an electronic ...
Pierre Girard