Optimal algebraic manipulation detection codes in the constant-error model

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

Volumn 9014, Issue , 2015, Pages 481-501

  Cramer, Ronald ^a   Padró, Carles ^b   Xing, Chaoping ^c  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CRYPTOGRAPHY; ERRORS;

ALGEBRAIC MANIPULATIONS; AUTHENTICATION CODES; CONSTRUCTIVE METHODS; ERROR CORRECTING CODE; EXPLICIT CONSTRUCTIONS; MULTIPLICATIVE FACTORS; POLYNOMIAL EVALUATION; SECURE MESSAGE TRANSMISSION;

CODES (SYMBOLS);

EID: 84924672174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-46494-6_20     Document Type: Conference Paper

References (13)

1. Ahmadi, H., Safavi-Naini, R.: Detection of Algebraic Manipulation in the Presence of Leakage. In: Padró, C. (ed.) ICITS 2013. LNCS, vol. 8317, pp. 238-258. Springer, Heidelberg (2014).
2. Bazzi, L. M. J., Mitter, S. K.: Some Randomized Code Constructions from Group Actions. IEEE Trans. Inf. Theory 52, 3210-3219 (2006).
3. Broadbent, A., Tapp, A.: Information-theoretic security without an honest majority. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 410-426. Springer, Heidelberg (2007), http://arxiv. org/abs/0706. 2010.
4. Cabello, S., Padró, C., Sáez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptogr. 25, 175-188 (2002).
5. Cramer, R., Dodis, Y., Fehr, S., Padró, C., Wichs, D.: Information-theoretic security without an honest majority. In: Smart, N. P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471-488. Springer, Heidelberg (2008).
6. Cramer, R., Fehr, S., Padró, C.: Algebraic manipulation detection codes. Sci. China Math. 56, 1349-1358 (2013).
7. Dziembowski, S., Pietrzak, K., Wichs, D.: Non-Malleable Codes. In: Innovations in Computer Science, ICS 2010, pp. 434-452 (2010).
8. Fan, Y., Lin, L.: Thresholds of random quasi-abelian codes (2013), http://arxiv. org/pdf/1306. 5377. pdf.
9. Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On Complete Primitives for Fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 91-108. Springer, Heidelberg (2010).
10. Guruswami, V., Smith, A.: Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate. In: FOCS 2010, pp. 723-732 (2010), Full version available at arXiv. org, arXiv: 1004. 4017 [cs. IT].
11. Karpovski, M., Wang, Z.: Algebraic Manipulation Detection Codes and Their Applications for Design of Secure Communication or Computation Channels (2011) (manuscript), http://mark. bu. edu/papers/226. pdf.
12. Wang, Z., Karpovsky, M.: Algebraic manipulation detection codes and their applications for design of secure cryptographic devices. In: IEEE 17th International On-Line Testing Symposium, IOLTS 2011, pp. 234-239 (2011).
13. Wee, H.: Public Key Encryption against Related Key Attacks. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 262-279. Springer, Heidelberg (2012).