Sciweavers

2601 search results - page 116 / 521
» Secure Rewarding Schemes
Sort
View
EUROCRYPT
2007
Springer
15 years 7 months ago
A Fast and Key-Efficient Reduction of Chosen-Ciphertext to Known-Plaintext Security
Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes...
Ueli M. Maurer, Johan Sjödin
CSI
2007
54views more  CSI 2007»
15 years 3 months ago
A practical verifiable multi-secret sharing scheme
C.-C. Yang, T.-Y. Chang, M.-S. Hwang [C.-C. Yang, T.-Y. Chang, M.-S. Hwang, A (t,n) multi-secret sharing scheme, Applied Mathematics and Computation 151 (2004) 483–490] proposed...
Jian-jie Zhao, Jianzhong Zhang 0005, Rong Zhao
CCS
2010
ACM
15 years 3 months ago
Computational indistinguishability logic
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
Gilles Barthe, Marion Daubignard, Bruce M. Kapron,...
AINA
2005
IEEE
15 years 8 months ago
Reducing Security Overhead for Mobile Networks
Security of mobile communications comes with the cost of computational overhead. Reducing the overhead in security computations is critical to ensure the overall performance of a ...
Fangguo Zhang, Yi Mu, Willy Susilo
SEC
2003
15 years 4 months ago
Secure Audit Logging with Tamper-Resistant Hardware
Secure perimeter schemes (e.g. DRM) and tracing traitor schemes (e.g. watermarking, audit logging) strive to mitigate the problems of content escaping the control of the rights ho...
Cheun Ngen Chong, Zhonghong Peng, Pieter H. Hartel