How to compress rabin cipher-texts and signatures (and more)

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

Volumn 3152, Issue , 2004, Pages 179-200

  Gentry, Craig ^a  

^a DOCOMO USA LABS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SECURITY OF DATA;

CIPHERTEXTS; COMPOSITE MODULUS; COMPRESSION ALGORITHMS; COMPUTATIONAL OVERHEADS; HASH SIGNATURE; RANDOM ORACLE MODEL;

NETWORK SECURITY;

EID: 35048859741     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_11     Document Type: Article

References (34)

1. T.M. Apostol, Modular Functions and Dirichlet Series in Number Theory, Springer-Verlag (1976).
2. K. Barr and K. Asanović, Energy Aware Lossless Data Compression, in Proc. of MobiSys 2003.
3. M. Bellare and P. Rogaway, The Exact Security of Digital Signatures - How to Sign with RSA and Rabin, in Proc. of Eurocrypt 1996, LNCS 1070, pages 399-416. Springer-Verlag, 1996.
4. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption - How to Encrypt with RSA, in Proc. of Eurocrypt 1994, LNCS 950, pages 92-111. Springer-Verlag, 1994.
5. D.J. Bernstein, A Secure Public-Key Signature System with Extremely Fast Verification, 2000. Available at http://cr.yp.to/djb.html.
6. D.J. Bernstein, Proving Tight Security for Standard Rabin-Williams Signatures, 2003. Available at http://cr.yp.to/djb.html.
7. D.J. Bernstein, Reducing Lattice Bases to Find Small-Height Values of Univariate Polynomials, 2003. Available at http://cr.yp.to/djb.html.
8. D. Bleichenbacher, Compressed Rabin Signatures, in Proc. of CT-RSA 2004.
9. D. Boneh, Simplified OAEP for the RSA and Rabin Functions, in Proc. of Crypto 2001, LNCS 2139, pages 275-291. Springer-Verlag, 2001.
10. D. Boneh, C. Gentry, B. Lynn, and H. Shacham, Aggregate and Verifiably Encrypted Signatures from Bilinear Maps, in Proc. of Eurocrypt 2003, LNCS 2656, pages 416-432. Springer-Verlag, 2003.
11. rq for Large r, in Proc. of Crypto 1999, LNCS 1666, pages 326-337. Springer-Verlag, 1999.
12. D. Boneh and R. Venkatesan, Breaking RSA May Not Be Equivalent to Factoring, in Proc. of Eurocrypt 1998, LNCS 1233, pages 59-71. Springer-Verlag, 1998.
13. C. Cocks, An Identity Based Encryption Scheme Based on Quadratic Residues, in Proc. of Cryptography and Coding 2001, LNCS 2260, Springer (2001). Available at http://www.cesg.gov.uk/technology/id-pkc/media/ciren.pdf.
14. H. Cohen, A Course in Computational Algebraic Number Theory, 4th ed., Graduate Texts in Mathematics, Springer, 2000.
15. J.S. Coron, On the Exact Security of Full Domain Hash, in Proc. of Crypto 2000, LNCS 1880, pages 229-235. Springer-Verlag, 2000.
16. J.-S. Coron, Security Proof for Partial-Domain Hash Signature Schemes, In Proc. of Crypto 2002, LNCS 2442, pages 613-626. Springer-Verlag, 2002.
17. D. Coppersmith, Finding a Small Root of a Univariate Modular Equation, in Proc. of Eurocrypt 1996, LNCS 1070, pages 155-165. Springer-Verlag, 1996.
18. U. Feige, A. Fiat, A. Shamir, Zero-Knowledge Proofs of Identity, in Jour, of Cryptology (1), pp. 77-94 (1988).
19. A. Fiat, A. Shamir, How to Prove Yourself: Practical Solutions to Identification and Signature Problems, in Proc. of Crypto 1986, LNCS 263, pp. 186-194. Springer (1986).
20. th edition).
21. J. Jonsson, A, OAEP Variant with a Tight Security Proof, 2003. Available at http://www.math.kth.se/~jakobj/crypto.html.
22. A.K. Lenstra and E.R. Verheul, The XTR Public Key System, In Proc. of Crypto 2000, LNCS 1880, pages 1-20. Springer-Verlag, 2000.
23. A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham, Sequential Aggregate Signatures from Trapdoor Homomorphic Permutations, in Proc. of Eurocrypt 2004, LNCS 3027, pages 74-90. Springer-Verlag, 2004.
24. J. Malone-Lee and W. Mao, Two Birds One Stone: Signcryption Using RSA, 2002. Available at http: //www.hpl.hp. com/techreports/2002/HPL-2002-293.html.
25. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
26. S. Micali, A. Shamir, An Improvement of the Fiat-Shamir Identification and Signature Scheme, in Proc. of Crypto 1988, LNCS 403, pp. 244-247. Springer-Verlag (1990).
27. H. Ong, C.P. Schnorr, Fast Signature Generation with a Fiat Shamir - Like Scheme, in Proc. of Eurocrypt 1990, LNCS 473, pp. 432-440. Springer-Verlag (1990).
28. M.O. Rabin, Digitalized Signatures and Public-Key Functions as Intractable as Factorization, MIT/LCS/TR-212, MIT Laboratory for Computer Science, 1979.
29. R.L. Rivest, A. Shamir, and Y. Tauman, How to Leak a Secret, in Proc. of Asiacrypt 2001, LNCS 2248, pages 552-565. Springer-Verlag, 2001.
30. K. Rubin and A. Silverberg, Torus-based Cryptography, in Proc. of Crypto 2003, LNCS 2729, pages 349-365. Springer-Verlag, 2003.
31. V. Shoup, OAEP Reconsidered, in Proc. of Crypto 2001, LNCS 2139, pages 239-259. Springer-Verlag, 2001.
32. A.K. Lenstra, A. Shamir, J. Tomlinson and E. Tromer, Analysis of Bernstein's Factorization Circuit, in Proc. of Asiacrypt 2002, LNCS 2501, pages 1-26. Springer-Verlag, 2002.
33. B. Vallée, Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues, In Proc. of STOC 1989, pages 98-106.
34. B. Vallée, Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms, Mathematics of Computation, vol. 56, no. 194, pages 823-849, 1991.