524 search results - page 25 / 105 » On the Security of the DeKaRT Primitive |
CANS
2011
Springer
12 years 9 months ago
2011
Springer
In this paper, we explore fast algorithms for computing on encrypted polynomials. More specifically, we describe efficient algorithms for computing the Discrete Fourier Transform,...
ASIACRYPT
2006
Springer
14 years 24 days ago
2006
Springer
Currently, the best and only evidence of the security of the OAEP encryption scheme is a proof in the contentious random oracle model. Here we give further arguments in support of...
WINET
2002
13 years 8 months ago
2002
As sensor networks edge closer towards wide-spread deployment, security issues become a central concern. So far, much research has focused on making sensor networks feasible and u...
ACISP
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. The past few years have seen the emergence of a large number of proposals for electronic payments over open networks. Among these proposals is the Secure Electronic Trans...
TIT
2011
13 years 4 months ago
2011
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...