Sciweavers

2601 search results - page 188 / 521
» Secure Rewarding Schemes
Sort
View
IJISEC
2007
87views more  IJISEC 2007»
15 years 3 months ago
Breaking four mix-related schemes based on Universal Re-encryption
Universal Re-encryption allows El-Gamal ciphertexts to be re-encrypted without knowledge of their corresponding public keys. This has made it an enticing building block for anonymo...
George Danezis
116
Voted
ACSAC
2009
IEEE
15 years 10 months ago
Online Sketching of Network Flows for Real-Time Stepping-Stone Detection
Abstract—We present an efficient and robust stepping-stone detection scheme based on succinct packet-timing sketches of network flows. The proposed scheme employs an online alg...
Baris Coskun, Nasir D. Memon
130
Voted
ICALP
2005
Springer
15 years 9 months ago
Single-Database Private Information Retrieval with Constant Communication Rate
We present a single-database private information retrieval (PIR) scheme with communication complexity O(k+d), where k ≥ log n is a security parameter that depends on the database...
Craig Gentry, Zulfikar Ramzan
ACISP
2004
Springer
15 years 9 months ago
Convertible Nominative Signatures
Abstract. A feasible solution to prevent potential misuse of signatures is to put some restrictions on their verification. Therefore S.J.Kim, S.J.Park and D.H.Won introduced the n...
Zhenjie Huang, Yumin Wang
ICIP
2004
IEEE
16 years 5 months ago
A blind cdma image watermarking scheme in wavelet domain
The paper proposes a blind spread spectrum watermarking scheme where watermark information is embedded redundantly in the multilevel wavelet coefficients of the cover image. It ha...
Santi P. Maity, Malay Kumar Kundu