The arithmetic codex

2012 IEEE Information Theory Workshop, ITW 2012

Volumn , Issue , 2012, Pages 75-79

  Cascudo, Ignacio ^a   Cramer, Ronald ^a   Xing, Chaoping ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC COMPLEXITY; BILINEAR COMPLEXITY; FINITE FIELDS; FUNCTION FIELDS; INVITED TALK; MATHEMATICAL FRAMEWORKS; SECRET SHARING SCHEMES; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY; FINITE ELEMENT METHOD;

INFORMATION THEORY;

EID: 84873157776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2012.6404767     Document Type: Conference Paper

References (33)

1. S. Ballet, R. Rolland. On the bilinear complexity of the multiplication in finite fields. Séminaires et Congrés 11, 2005, 179-188.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proc. of STOC 1988, pp. 1-10. ACM Press, 1988.
3. P. Bürgisser, M. Clausen, M.A. Shokrollahi. Algebraic Complexity Theory. Series: Grundlehren der math. Wiss. Vol. 315, Springer, 1997.
4. I. Cascudo, H. Chen, R. Cramer, C. Xing. Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Finite Field. Proc. of 29th Annual IACR CRYPTO, Santa Barbara, Ca., USA, Springer Verlag LNCS, vol. 5677, pp. 466-486, August 2009.
5. I. Cascudo, R. Cramer, C. Xing. The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing. Proc. of 31st Annual IACR CRYPTO, Santa Barbara, Ca., USA, Springer Verlag LNCS, vol. 6842, pp. 685-705, August 2011.
6. I. Cascudo, R. Cramer, C. Xing. Torsion Limits and Riemann-Roch Systems for Function Fields and Applications. Manuscript, 2012. Available at http://arxiv.org/abs/1207.2936
7. I. Cascudo, R. Cramer, C. Xing. Bounds on the Threshold Gap in Secret Sharing over Small Fields. Manuscript, 2012. Available at http://eprint.iacr. org/2012/319
8. I. Cascudo, R. Cramer, C. Xing, A. Yang. Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields. IEEE Transactions on Information Theory, Vol. 58, Issue 7, pp. 4930-4935, 2012.
9. D. Chaum, C. Crépeau, and I. Damgaard. Multi-party unconditionally secure protocols. Proc. of STOC 1988, pp. 11-19. ACM Press, 1988.
10. H. Chen and R. Cramer. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computation over Small Fields. Proc. of 26th Annual IACR CRYPTO, Springer Verlag LNCS, vol. 4117, pp. 516-531, Santa Barbara, Ca., USA, August 2006.
11. H. Chen, R. Cramer, R. de Haan, I. Cascudo Pueyo. Strongly multiplicative ramp schemes from high degree rational points on curves. Proc. of 27th Annual IACR EUROCRYPT, Istanbul, Turkey, Springer Verlag LNCS, vol. 4965, pp. 451-470, April 2008.
12. H. Chen, R. Cramer, S. Goldwasser, R. de Haan, V. Vaikuntanathan. Secure Computation from Random Error Correcting Codes. Proc. of 27th Annual IACR EUROCRYPT, Barcelona, Spain, Springer Verlag LNCS, vol. 4515, pp. 291-310, 2007.
13. D.V. Chudnovsky, G.V. Chudnovsky. Algebraic complexities and algebraic curves over finite fields. Proc. Natl. Acad. Sci. USA, vol. 84, no. 7, pp. 1739-1743, April 1987.
14. R. Cramer, I. Damgaard, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme. Proc. of 19th Annual IACR EUROCRYPT, Brugge, Belgium, Springer Verlag LNCS, vol. 1807, pp. 316-334, May 2000.
15. R. Cramer, V. Daza, I. Gracia, J. Jiménez Urroz, G. Leander, J. Martí-Farré, C. Padró. On Codes, Matroids and Secure Multi-Party Computation from Linear Secret Sharing Schemes. IEEE Transactions on Information Theory, 54(6): 2644-2657 (2008), June 2008.
16. R. Cramer, I. Damgaard, V. Pastro. On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations. Proc. 6th ICITS, 2012. Preliminary version at http://eprint.iacr.org/2011/301.
17. I. Damgaard, Y. Ishai and M. Krøigaard. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. Proc. of 29th Annual IACR EUROCRYPT, Nice, France, Springer Verlag LNCS, vol. 6110, pp. 445-465, May 2010.
18. M. K. Franklin, M. Yung. Communication Complexity of Secure Computation (Extended Abstract). Proc. of STOC 1992, pp. 699-710
19. A. Garcia, H. Stichtenoth. A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlǎduţ bound. Invent. Math. 121, pp. 211-222, 1995.
20. A. Garcia, H. Stichtenoth, A. Bassa, P. Beelen. Towers of function fields over non-prime finite fields. Preprint, 2012. See http://arxiv.org/abs/1202. 5922
21. V. D. Goppa. Codes on algebraic curves. Soviet Math. Dokl, 24:170-172, 1981.
22. D. Harnik, Y. Ishai, E. Kushilevitz, J. Nielsen. OT-Combiners via Secure Computation. Proc. of TCC 2008, pp. 393-411.
23. Y. Ihara. Some remarks on the number of rational points of algebraic curves over finite fields. J. Fac. Sci. Tokyo 28 (1981), 3, pp. 721-724.
24. Y. Ishai, E. Kushilevitz, R. Ostrovsky, M. Prabhakaran, A. Sahai, J. Wullschleger. Constant-rate OT from Noisy Channels. Proceeding of 31st Annual IACR CRYPTO, Santa Barbara, Ca., USA, Springer Verlag LNCS, vol. 6842, pp. 667-684, August 2011.
25. Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai. Extracting Correlations. Proc. 50th IEEE FOCS, pp. 261-270, 2009.
26. Y. Ishai, E. Kushilevitz, R. Ostrovsky, A. Sahai. Zero-knowledge from secure multiparty computation. Proc. of 39th STOC, San Diego, Ca., USA, pp. 21-30, 2007.
27. Y. Ishai, M. Prabhakaran, A. Sahai. Founding Cryptography on Oblivious Transfer-Efficiently. Proc. of 28th Annual IACR CRYPTO, Santa Barbara, Ca., USA, Springer Verlag LNCS, vol. 5157, pp. 572-591, August 2008.
28. H. Randriambololona. Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method. Preprint, 2011. See http://arxiv.org/pdf/1107.0336v5.pdf.
29. A. Shamir. How to share a secret. Comm. ACM, 22(11):612-613, 1979.
30. I. Shparlinski, M. Tsfasman, S. Vlǎduţ. Curves with many points and multiplication in finite fields. Lecture Notes in Math., vol. 1518, Springer-Verlag, Berlin, 1992, pp. 145-169.
31. H. Stichtenoth. Algebraic function fields and codes. Springer Verlag, 1993. (New edition: 2009).
32. M. Tsfasman, S. Vlǎduţ, Th. Zink. Modular curves, Shimura curves, and Goppa codes, better than Varshamov Gilbert bound. Math. Nachr. 109, 21-28, 1982.
33. S. G. Vlǎduţ, V. G. Drinfeld. Number of points of an algebraic curve. Funct. Anal. Appl. vol. 17, pp. 53-54, 1983.