Multiplexing schemes for homomorphic cryptosystems

• Corena, Juan Camilo ^[2] ; Posada, Jaime Andrés ^[1]
  1. [1] Politécnico Grancolombiano

     Politécnico Grancolombiano

     Colombia

     
  2. [2] Universidad de los Andes.
• Localización: Elementos, ISSN-e 2248-5252, Vol. 1, Nº. 1, 2011 (Ejemplar dedicado a: Elementos), págs. 24-32
• Idioma: inglés
• DOI: 10.15765/e.v1i1.189
• Enlaces
  • Texto completo (pdf)
• Resumen

  • We present in this article two secure multiplexing and demul- tiplexing schemes that use homomorphic properties from known public key cryptosystems. One scheme is suitable for cryptosystems with addi- tive homomorphic properties such as Paillier and Benaloh cryptosystems. The proposed scheme employs a modification of Hadamard codes to generate a set of orthogonal codes over Z3. The other one is suitable for cryptosystems with multiplicative homomorphic properties such as RSA and ElGamal. Both schemes might be used in voting and auction systems where anonymity of the individuals is crucial.

• Referencias bibliográficas
  • Abe, M. and Suzuki, K.: M+1-st price auction using homomorphic encryption. Public Key Cryptography, pages 115–124, (2002)
  • Adida, B. and Rivest, R. L.: Scratch & vote: self-contained paper-based crypto- graphic voting. WPES ’06: Proceedings of the 5th ACM workshop...
  • Baudron O., Fouque P. A., Pointcheval, D., Stern, J. and Poupard G.: Practical multi-candidate election system. PODC ’01: Proceedings of the...
  • Benaloh, J. C. and Tuinstra, D.: Receipt-free secret-ballot elections (extended abstract). In STOC, pages 544–553, (1994)
  • Clarkson, J. B.: Dense probabilistic encryption. Proceedings of the Workshop on Selected Areas of Cryptography, pages 120–128, (1994)
  • Cramer, R., Gennaro, R. and Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. EUROCRYPT, pages 103–118, (1997)
  • Cramer, R. J., Franklin, M., Schoenmakers, L. A. and Yung, M.: Multi-authority secret-ballot elections with linear work. Technical report,...
  • ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469–472,...
  • Kikuchi, H., Harkavy, M. and Tygar, J. D.: Multi-round anonymous auction protocols. Proceedings of the First IEEE Workshop on Dependable and...
  • Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. EUROCRYPT, pages 223–238, (1999)
  • Rivest, R. L., Shamir A., and Adleman, L. M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21(2):120–126,...
  • Viterbi, A. J.: CDMA: principles of spread spectrum communication. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, (1995)