15 search results - page 3 / 3 » On the Security of RSA with Primes Sharing Least-Significant... |
EUROCRYPT
2000
Springer
13 years 8 months ago
2000
Springer
We discuss the following problem: Given an integer shared secretly among n players and a prime number e, how can the players efficiently compute a sharing of e-1 mod . The most in...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, a novel data hiding technique is proposed, as an improvement over the Fibonacci LSB data-hiding technique proposed by Battisti et al. [1] based on decomposition of ...
FOCS
2010
IEEE
13 years 2 months ago
2010
IEEE
A fundamental question in leakage-resilient cryptography is: can leakage resilience always be amplified by parallel repetition? It is natural to expect that if we have a leakage-r...
CCS
2007
ACM
13 years 11 months ago
2007
ACM
Wireless sensor nodes generally face serious limitations in terms of computational power, energy supply, and network bandwidth. Therefore, the implementation of effective and sec...
SCN
2010
Springer
13 years 2 months ago
2010
Springer
Serge Vaudenay [20] introduced a notion of Message Authentication (MA) protocols in the Short Authenticated String (SAS) model. A SAS-MA protocol authenticates arbitrarily long mes...