103 search results - page 18 / 21 » Security of public key cryptosystems based on Chebyshev Poly... |
ASIACRYPT
2009
Springer
14 years 3 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...
CORR
2010
Springer
13 years 8 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...
CCS
2008
ACM
13 years 10 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...
EUROCRYPT
2011
Springer
13 years 2 days 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...
ASIACRYPT
2001
Springer
14 years 7 days 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...