488 search results - page 41 / 98 » Policy-Based Cryptography and Applications |
114
click to vote
PKC
2005
Springer
15 years 6 months ago
2005
Springer
In typical RSA, it is impossible to create a key pair (e, d) such that both are simultaneously much shorter than φ(N). This is because if d is selected first, then e will be of t...
91
Voted
EUROCRYPT
2003
Springer
15 years 5 months ago
2003
Springer
ded abstract of this paper appears in Advances in Cryptology – EUROCRYPT ’03, Lecture Notes in Computer Science Vol. 2656, E. Biham ed., Springer-Verlag, 2003. This is the full...
100
Voted
CCS
2001
ACM
15 years 5 months ago
2001
ACM
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
134
Voted
ICISC
2000
15 years 2 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
100
click to vote
TCC
2009
Springer
16 years 1 months ago
2009
Springer
It is well known that general secure function evaluation (SFE) with information-theoretical (IT) security is infeasible in presence of a corrupted majority in the standard model. ...