Cryptography Reference
In-Depth Information
17. Gemmell, P.: An introduction to threshold cryptography. RSA CryptoBytes 2(3),
7-12 (1997)
18. Kawachi, A., Tanaka, K., Xagawa, K.: Concurrently Secure Identification Schemes
Based on the Worst-Case Hardness of Lattice Problems. In: Pieprzyk, J. (ed.)
ASIACRYPT 2008. LNCS, vol. 5350, pp. 372-389. Springer, Heidelberg (2008)
19. Kiltz, E.: Chosen-Ciphertext Security from Tag-Based Encryption. In: Halevi, S.,
Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 581-600. Springer, Heidelberg
(2006)
20. Mohassel, P.: One-Time Signatures and Chameleon Hash Functions. In: Biryukov,
A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 302-319.
Springer, Heidelberg (2011)
21. Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ci-
phertext attacks. In: Proceedings of the Twenty-Second Annual ACM Symposium
on Theory of Computing, pp. 427-437. ACM (1990)
22. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem:
extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory
of Computing, pp. 333-342. ACM (2009)
23. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Pro-
ceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 187-
196. ACM (2008)
24. Rackoff, C., Simon, D.: Non-Interactive Zero-Knowledge Proof of Knowledge
and Chosen Ciphertext Attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS,
vol. 576, pp. 433-444. Springer, Heidelberg (1992)
25. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography.
In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of
Computing, pp. 84-93. ACM (2005)
26. Rosen, A., Segev, G.: Ecient lossy trapdoor functions based on the composite
residuosity assumption. IACR ePrint Archive (2008)
27. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612-613
(1979)
28. Shoup, V.:
A
proposal
for
an
ISO standard
for
public
key
encryption.
Manuscript 100, 101-103 (2001)
29. Shoup, V., Gennaro, R.: Securing Threshold Cryptosystems Against Chosen Ci-
phertext Attack. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp.
1-16. Springer, Heidelberg (1998)
30. Wegman, M.N., Carter, J.L.: New hash functions and their use in authentication
and set equality. Journal of Computer and System Sciences 22(3), 265-279 (1981)
31. Zhang, R., Hanaoka, G., Shikata, J., Imai, H.: On the Security of Multiple En-
cryption or CCA-Security+ CCA-Security= CCA-Security? In: Bao, F., Deng, R.,
Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 360-374. Springer, Heidelberg
(2004)
