17 search results - page 1 / 4 » Improved Non-committing Encryption Schemes Based on a Genera... |
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. Non-committing encryption enables the construction of multiparty computation protocols secure against an adaptive adversary in the computational setting where private cha...
ASIACRYPT
2009
Springer
13 years 11 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...
JOC
2010
13 years 3 months ago
2010
We present a new encryption scheme which is secure against adaptive chosenciphertext attack (or CCA2-secure) in the standard model (i.e. without the use of random oracle). Our sch...
CCS
2004
ACM
13 years 10 months ago
2004
ACM
Hidden credentials are useful in protecting sensitive resource requests, resources, policies, and credentials. We propose a significant performance improvement when implementing ...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
At EuroCrypt’99, Paillier proposed a new encryption scheme based on higher residuosity classes. The new scheme was proven to be one-way under the assumption that computing N-resi...