Security and efficiency analysis of the Hamming distance computation protocol based on oblivious transfer

E-ISSN： 1939-0122|8|18|4123-4135

ISSN： 1939-0114

Source： SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol.8, Iss.18, 2015-12, pp. : 4123-4135

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Center Location Improvement Problem Under the Hamming Distance

By Zhang Binwu Zhang Jianzhong He Yong

Journal of Combinatorial Optimization, Vol. 9, Iss. 2, 2005-03 ,pp. : 187-198

Springer Publishing Company

Access to resources Recommend Favorite

The shortest path improvement problems under Hamming distance

By Zhang Binwu Zhang Jianzhong Qi Liqun

Journal of Combinatorial Optimization, Vol. 12, Iss. 4, 2006-12 ,pp. : 351-361

Springer Publishing Company

Access to resources Recommend Favorite

A Magic Trick Based on the Hamming Code

By Mateer Todd

Math Horizons, Vol. 21, Iss. 2, 2013-11 ,pp. : 9-11

Mathematical Association of America

Access to resources Recommend Favorite

Efficient oblivious transfer with adaptive queries in UC framework

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 9, Iss. 15, 2016-10 ,pp. : 2592-2611

John Wiley & Sons Inc

Access to resources Recommend Favorite

Explicit Computation of Generalized Hamming Weights for Some Algebraic Geometric Codes

By Chen H. Luk H.S. Yau S.

Advances in Applied Mathematics, Vol. 21, Iss. 1, 1998-07 ,pp. : 124-145

Academic Press

Access to resources Recommend Favorite