Secure and efficient constructions of hash, MAC and PRF for mobile devices

Yan Zhu, Shanbiao Wang, Di Ma, Hongxin Hu, Gail-Joon Ahn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Numerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it increasingly more difficult for proper implementation and management. Thus, it is desired to simplify management and improve efficiency by means of designing a general function family to meet a variety of security requirements. In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB). We further improve the efficiency of these algorithms by using 'circular convolution with carry bits' which makes parallel processing possible. We prove the security of these functions based on the privacy in hidden number problem and hard-core predicate of one-way function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(kn/w) for n-bit message, k-bit output and w-bit word size.

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages949-954
Number of pages6
DOIs
StatePublished - 2012
Event2012 IEEE Global Communications Conference, GLOBECOM 2012 - Anaheim, CA, United States
Duration: Dec 3 2012Dec 7 2012

Other

Other2012 IEEE Global Communications Conference, GLOBECOM 2012
CountryUnited States
CityAnaheim, CA
Period12/3/1212/7/12

Fingerprint

Mobile devices
Convolution
Processing

Keywords

  • Algorithm
  • Cryptography
  • Hash
  • Hidden Number Problem
  • MAC
  • Pseudorandom

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Zhu, Y., Wang, S., Ma, D., Hu, H., & Ahn, G-J. (2012). Secure and efficient constructions of hash, MAC and PRF for mobile devices. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 949-954). [6503235] https://doi.org/10.1109/GLOCOM.2012.6503235

Secure and efficient constructions of hash, MAC and PRF for mobile devices. / Zhu, Yan; Wang, Shanbiao; Ma, Di; Hu, Hongxin; Ahn, Gail-Joon.

GLOBECOM - IEEE Global Telecommunications Conference. 2012. p. 949-954 6503235.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhu, Y, Wang, S, Ma, D, Hu, H & Ahn, G-J 2012, Secure and efficient constructions of hash, MAC and PRF for mobile devices. in GLOBECOM - IEEE Global Telecommunications Conference., 6503235, pp. 949-954, 2012 IEEE Global Communications Conference, GLOBECOM 2012, Anaheim, CA, United States, 12/3/12. https://doi.org/10.1109/GLOCOM.2012.6503235
Zhu Y, Wang S, Ma D, Hu H, Ahn G-J. Secure and efficient constructions of hash, MAC and PRF for mobile devices. In GLOBECOM - IEEE Global Telecommunications Conference. 2012. p. 949-954. 6503235 https://doi.org/10.1109/GLOCOM.2012.6503235
Zhu, Yan ; Wang, Shanbiao ; Ma, Di ; Hu, Hongxin ; Ahn, Gail-Joon. / Secure and efficient constructions of hash, MAC and PRF for mobile devices. GLOBECOM - IEEE Global Telecommunications Conference. 2012. pp. 949-954
@inproceedings{61c9c8c807914335bc9b996fb87fc385,
title = "Secure and efficient constructions of hash, MAC and PRF for mobile devices",
abstract = "Numerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it increasingly more difficult for proper implementation and management. Thus, it is desired to simplify management and improve efficiency by means of designing a general function family to meet a variety of security requirements. In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB). We further improve the efficiency of these algorithms by using 'circular convolution with carry bits' which makes parallel processing possible. We prove the security of these functions based on the privacy in hidden number problem and hard-core predicate of one-way function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(kn/w) for n-bit message, k-bit output and w-bit word size.",
keywords = "Algorithm, Cryptography, Hash, Hidden Number Problem, MAC, Pseudorandom",
author = "Yan Zhu and Shanbiao Wang and Di Ma and Hongxin Hu and Gail-Joon Ahn",
year = "2012",
doi = "10.1109/GLOCOM.2012.6503235",
language = "English (US)",
isbn = "9781467309219",
pages = "949--954",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Secure and efficient constructions of hash, MAC and PRF for mobile devices

AU - Zhu, Yan

AU - Wang, Shanbiao

AU - Ma, Di

AU - Hu, Hongxin

AU - Ahn, Gail-Joon

PY - 2012

Y1 - 2012

N2 - Numerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it increasingly more difficult for proper implementation and management. Thus, it is desired to simplify management and improve efficiency by means of designing a general function family to meet a variety of security requirements. In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB). We further improve the efficiency of these algorithms by using 'circular convolution with carry bits' which makes parallel processing possible. We prove the security of these functions based on the privacy in hidden number problem and hard-core predicate of one-way function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(kn/w) for n-bit message, k-bit output and w-bit word size.

AB - Numerous cryptographic techniques have been developed to be used on mobile devices for various security and privacy protections. However, these cryptographic primitives, working under different mathematical assumptions, tend to become more and more complex and intricate, which makes it increasingly more difficult for proper implementation and management. Thus, it is desired to simplify management and improve efficiency by means of designing a general function family to meet a variety of security requirements. In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB). We further improve the efficiency of these algorithms by using 'circular convolution with carry bits' which makes parallel processing possible. We prove the security of these functions based on the privacy in hidden number problem and hard-core predicate of one-way function. We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(kn/w) for n-bit message, k-bit output and w-bit word size.

KW - Algorithm

KW - Cryptography

KW - Hash

KW - Hidden Number Problem

KW - MAC

KW - Pseudorandom

UR - http://www.scopus.com/inward/record.url?scp=84877643830&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877643830&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2012.6503235

DO - 10.1109/GLOCOM.2012.6503235

M3 - Conference contribution

SN - 9781467309219

SP - 949

EP - 954

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -