Addition of ElGamal plaintexts

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1976, Issue , 2000, Pages 346-358

  Jakobsson, Markus ^a   Juels, Ari ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b RSA Security Inc   (United States)

Author keywords

Addition; Directed decryption; ElGamal; Fast track; Repetition robustness

Indexed keywords

COMPUTATION THEORY; SECURITY OF DATA;

ADDITION; DIRECTED DECRYPTION; ELGAMAL; ENCRYPTED DATA; FAST TRACKS;

CRYPTOGRAPHY;

EID: 58349092253     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_26     Document Type: Conference Paper

References (17)

1. D. Chaum, “Zero-Knowledge Undeniable Signatures,” in Advances in Cryptology – EUROCRYPT’90, I Damgård, ed., pp. 458–464, Springer-Verlag, 1990. LNCS No. 473.
2. D. Chaum and H. van Antwerpen, “Undeniable Signatures,” in Advances in Cryptology – CRYPTO’89, G. Brassard, ed., pp. 212–216, Springer-Verlag, 1989. LNCS No. 435.
3. D. Coppersmith, “Fast evaluation of logarithms in fields of characteristic two,” IEEE Transactions of Information Theory, 30 (1984), 587–594.
4. T. ElGamal, “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Transactions on Information Theory, vol. 31, pp. 469-472, 1985.
5. M. Franklin and M. Yung, “Communication Complexity of Secure Computation”, in Proc. 24th Annual Symp. on the Theory of Computation (STOC), pp. 699-710, ACM Press, 1992.
6. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Secure Distributed Key Generation for Discrete-Log Based Cryptosystems”, in Advances in Cryptology – EUROCRYPT’99, J. Stern, ed., pp. 295–310, Springer-Verlag, 1999. LNCS No. 1592.
7. R. Gennaro, M. Rabin, and T. Rabin, “Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography”, in Proc. 1998 ACM Symposium on Principles of Distributed Computing (PODC), ACM Press, 1999.
8. M. Jakobsson and C.-P. Schnorr, “Efficient Oblivious Proofs of Correct Exponentiation,” in Communications and Multimedia Security (CMS)’99, B. Preneel, ed., pp. 71–84, Kluwer Academic Publishers.
9. M. Jakobsson, “A Practical Mix,” in Advances in Cryptology – EUROCRYPT’98, K. Nyberg, ed., pp. 448–461, Springer-Verlag, 1998. LNCS No. 1403.
10. M. Jakobsson, “Flash Mixing,” in Proc. 1999 ACM Symposium on Principles of Distributed Computing (PODC), pp. 83–89, ACM Press, 1999.
11. A. Herzberg, S. Jarecki, H. Krawczyk, M. Yung, “Proactive Secret Sharing or How to Cope With Perpetual Leakage,” in Advances in Cryptology – Crypto’95, D. Coppersmith, ed., pp. 339–352, Springer-Verlag, 1995. LNCS No. 963.
12. K. McCurley, personal communication.
13. A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
14. T.P. Pedersen, “Distributed Provers with Applications to Undeniable Signatures,” in Advances in Cryptology – EUROCRYPT’91, D.W. Davies, ed., Springer- Verlag, pp. 221–242, 1991. LNCS No. 547.
15. T.P. Pedersen, “Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing,” in Advances in Cryptology – CRYPTO’91, J. Feigenbaum, ed., pp. 129–140, Springer-Verlag, 1991. LNCS NO. 576.
16. C.-P. Schnorr, “Efficient Signature Generation for Smart Cards,” Journal of Cryptology, vol. 4, pp. 161-174, 1991.
17. A. Shamir, “How to share a secret”, Communications of the ACM, vol. 22, pp. 612-613, 1979.