103 search results - page 18 / 21 » Security of public key cryptosystems based on Chebyshev Poly... |
171
click to vote
ASIACRYPT
2009
Springer
16 years 1 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
270
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Problem statement: This paper examines Artificial Spiking Neural Network (ASNN) which inter-connects group of artificial neurons that uses a mathematical model with the aid of blo...
172
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
The standard solution for user authentication on the Web is to establish a TLS-based secure channel in server authenticated mode and run a protocol on top of TLS where the user en...
206
click to vote
EUROCRYPT
2011
Springer
14 years 10 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
198
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...