Sciweavers

193 search results - page 7 / 39
» Fair Public-Key Cryptosystems
Sort
View
INDOCRYPT
2003
Springer
14 years 24 days ago
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
P. J. Abisha, D. G. Thomas, K. G. Subramanian
EUROCRYPT
1999
Springer
13 years 12 months ago
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
Pascal Paillier
EUROCRYPT
1997
Springer
13 years 11 months ago
A New Public-Key Cryptosystem
This paper describes a new public-key cryptosystem where the ciphertext is obtained by multiplying the public-keys indexed by the message bits and the cleartext is recovered by fac...
David Naccache, Jacques Stern
DAM
2007
63views more  DAM 2007»
13 years 7 months ago
Attacking a public key cryptosystem based on tree replacement
We point out several security flaws in the cryptosystem based on tree replacement systems proposed by Samuel, Thomas, Abisha and Subramanian at INDOCRYPT 2002. Due to the success...
Maria Isabel Gonzalez Vasco, David Pérez-Ga...
ACISP
2005
Springer
14 years 1 months ago
Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instea...
Bo-Yin Yang, Jiun-Ming Chen