12 search results - page 2 / 3 » Universally Anonymizable Public-Key Encryption |
PKC
2011
Springer
12 years 8 months ago
2011
Springer
xtended abstract which appears in the 2011 International Conference on Theory and Practice in Public Key Cryptography PKC 2011 (6–9 march 2011, Taormina, Italy) D. Catalano, N. F...
IACR
2011
12 years 5 months ago
2011
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
ASIACRYPT
2003
Springer
13 years 9 months ago
2003
Springer
Motivated by privacy issues associated with dissemination of signed digital certificates, we define a new type of signature scheme called a `Universal Designated-Verifier Signatur...
ASIACRYPT
2009
Springer
13 years 12 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
CCS
2007
ACM
13 years 11 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...