17 search results - page 3 / 4 » A Fast Semantically Secure Public Key Cryptosystem Based on ... |
STOC
2005
ACM
14 years 7 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose a way to establish peer-to-peer authenticated communications over an insecure channel by using an extra channel which can authenticate very short strings, e.g....
ASIACRYPT
2009
Springer
14 years 2 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...
CCS
2007
ACM
14 years 1 months ago
2007
ACM
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...
CORR
2010
Springer
13 years 7 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...