Author:
Finney Daniel Shadrach S.,Shiny Pershiya A.,Shirley Stevany Faryl A.,Balasamy K.,Chiranjeevi K.
Publisher
Springer International Publishing
Reference24 articles.
1. A. Adelsbach, S. Katzenbeisser and A.-R. Sadeghi, “Cryptography meets watermarking: Detecting watermarks with minimal or zero knowledge disclosure,” 2002 11th European Signal Processing Conference, Toulouse, France, 2002, pp. 1–4.
2. Brakerski, Z., Vaikuntanathan, V. (2011). Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages. In: Rogaway, P. (eds) Advances in Cryptology – CRYPTO 2011. CRYPTO 2011. Lecture Notes in Computer Science, vol 6841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22792-9_29.
3. Cramer, R., Damgard, I. (1998). Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free. In: Krawczyk, H. (eds) Advances in Cryptology — CRYPTO ‘98. CRYPTO 1998. Lecture Notes in Computer Science, vol 1462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055745.
4. ElGamal, T. (1985). A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. In: Blakley, G.R., Chaum, D. (eds) Advances in Cryptology. CRYPTO 1984. Lecture Notes in Computer Science, vol 196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39568-7_2.
5. Damgard, I., Jurik, M. & Nielsen, J.B. A generalization of Paillier’s public-key system with applications to electronic voting. Int. J. Inf. Secur. 9, 371–385 (2010). https://doi.org/10.1007/s10207-010-0119-9.