Sciweavers

2601 search results - page 68 / 521
» Secure Rewarding Schemes
Sort
View
CCS
2009
ACM
15 years 6 months ago
Attacking cryptographic schemes based on "perturbation polynomials"
We show attacks on several cryptographic schemes that have recently been proposed for achieving various security goals in sensor networks. Roughly speaking, these schemes all use ...
Martin Albrecht, Craig Gentry, Shai Halevi, Jonath...
JOC
2006
116views more  JOC 2006»
14 years 11 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
ACSAC
2008
IEEE
15 years 6 months ago
PAS: Predicate-Based Authentication Services Against Powerful Passive Adversaries
Securely authenticating a human user without assistance from any auxiliary device in the presence of powerful passive adversaries is an important and challenging problem. Passive ...
Xiaole Bai, Wenjun Gu, Sriram Chellappan, Xun Wang...
PKC
2005
Springer
110views Cryptology» more  PKC 2005»
15 years 5 months ago
From Fixed-Length to Arbitrary-Length RSA Encoding Schemes Revisited
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
Julien Cathalo, Jean-Sébastien Coron, David...
JNW
2006
149views more  JNW 2006»
14 years 11 months ago
Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes
Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the securit...
Shidi Xu, Yi Mu, Willy Susilo