research-article

Generalized homomorphic MACs with efficient verification

Authors:

Liang Feng Zhang,

Reihaneh Safavi-NainiAuthors Info & Claims

ASIAPKC '14: Proceedings of the 2nd ACM workshop on ASIA public-key cryptography

Pages 3 - 12

https://doi.org/10.1145/2600694.2600697

Published: 03 June 2014 Publication History

Abstract

Homomorphic MACs allow the holder of a secret key to construct authenticators for data blocks such that an untrusted server that computes a function of the data, can also compute an authenticator that can be verified by the key holder, guaranteeing correctness of the computation. Homomorphic MACs that allow verifiable computation of multivariate polynomials of degree ≤ 2 have been proposed by Backes, Fiore and Reischuk (CCS 2013). We generalize their construction such that polynomials of degree l>2 can also be computed. Our generalization uses multilinear map abstraction and has security based on the l-linear assumption.

References

[1]

S. Agrawal and D. Boneh. Homomorphic MACs: MAC-based integrity for network coding. In ACNS, 2009.

Digital Library

[2]

N. Attrapadung and B. Libert. Homomorphic network coding signatures in the standard model. In PKC, 2011.

Digital Library

[3]

N. Attrapadung, B. Libert, and T. Peters. Computing on authenticated data: New privacy definitions and constructions. In ASIACRYPT, 2012.

Digital Library

[4]

N. Attrapadung, B. Libert, and T. Peters. Efficient completely context-hiding quotable and linearly homomorphic signatures. In PKC, 2013.

[5]

M. Backes, D. Fiore, and R. M. Reischuk. Verifiable delegation of computation on outsourced data. In CCS, 2013.

Digital Library

[6]

S. Benabbas, R. Gennaro, and Y. Vahlis. Verifiable delegation of computation over large datasets. In CRYPTO, 2011.

Digital Library

[7]

N. Bitansky, R. Canetti, A. Chiesa, and E. Tromer. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In ITCS, 2012.

Digital Library

[8]

D. Boneh and D. M. Freeman. Homomorphic signatures for polynomial functions. In EUROCRYPT, 2011.

Digital Library

[9]

D. Boneh and D. M. Freeman. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures. In PKC, 2011.

Digital Library

[10]

D. Boneh, D. M. Freeman, J. Katz, and B. Waters. Signing a linear subspace: Signature schemes for network coding. In PKC, 2009.

Digital Library

[11]

D. Boneh, K. Lewi, H. W. Montgomery, and A. Raghunathan. Key homomorphic PRFs and their applications. In CRYPTO, 2013.

[12]

D. Boneh and A. Silverberg. Applications of multilinear forms to cryptography. IACR Cryptology ePrint Archive Report, 2002:80, 2002.

[13]

D. Catalano and D. Fiore. Practical homomorphic MACs for arithmetic circuits. In EUROCRYPT, 2013.

[14]

D. Catalano, D. Fiore, R. Gennaro, L. Nizzardo. Generalizing homomorphic MACs for arithmetic circuits. In PKC, 2014.

Digital Library

[15]

D. Catalano, D. Fiore, and B. Warinschi. Adaptive pseudo-free groups and applications. In EUROCRYPT, 2011.

Digital Library

[16]

D. Catalano, D. Fiore, and B. Warinschi. Efficient network coding signatures in the standard model. In PKC, 2012.

Digital Library

[17]

K. M. Chung, Y. T. Kalai, F. H. Liu, and R. Raz. Memory delegation. In CRYPTO, 2011.

Digital Library

[18]

J. S. Coron, T. Lepoint, and M. Tibouchi. Practical multilinear maps over the integers. In CRYPTO, 2013.

[19]

S. Garg, C. Gentry, and S. Halevi. Candidate multilinear maps from ideal lattices. In EUROCRYPT, 2013.

[20]

S. Garg, C. Gentry, S. Halevi, A. Sahai, and B. Waters. Attribute-based encryption for circuits from multilinear maps. In CRYPTO, 2013.

[21]

R. Gennaro, C. Gentry, and B. Parno. Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In CRYPTO, 2010.

Digital Library

[22]

R. Gennaro, J. Katz, H. Krawczyk, and T. Rabin. Secure network coding over the integers. In PKC, 2010.

Digital Library

[23]

R. Gennaro and D. Wichs. Fully homomorphic message authenticators. In ASIACRYPT, 2013.

[24]

C. Gentry and D. Wichs. Separating succinct non-interactive arguments from all falsifiable assumptions. In STOC, 2011.

Digital Library

[25]

M. T. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. In ISC, 2002.

Digital Library

[26]

R. Johnson, D. Molnar, D. Song, and D. Wagner. Homomorphic signature schemes. In CT-RSA, 2002.

Digital Library

[27]

A. B. Lewko and B. Waters. Efficient pseudorandom functions from the decisional linear assumption and weaker variants. In CCS, 2009.

Digital Library

[28]

M. Naor and K. Nissim. Certificate revocation and certificate update. IEEE Journal on Selected Areas in Communications, 18(4):561--570, 2000.

Digital Library

[29]

C. Papamanthou, E. Shi, and R. Tamassia. Signatures of correct computation. In TCC, 2013.

Digital Library

[30]

C. Papamanthou, R. Tamassia, and N. Triandopoulos. Optimal authenticated data structures with multilinear forms. In Pairing, 2010.

Digital Library

[31]

C. Papamanthou, R. Tamassia, and N. Triandopoulos. Optimal verification of operations on dynamic sets. In CRYPTO, 2011.

Digital Library

[32]

B. Parno, M. Raykova, and V. Vaikuntanathan. How to delegate and verify in public: Verifiable computation from attribute-based encryption. In TCC, 2012.

Digital Library

Cited By

Feng SZhang L(2023)An Efficient Method for Realizing Contractions of Access Structures in Cloud StorageIEEE Transactions on Services Computing10.1109/TSC.2023.332589416:6(4481-4492)Online publication date: Nov-2023
https://doi.org/10.1109/TSC.2023.3325894
Guan YZheng HShao JLu RWei G(2022)Fair Outsourcing Polynomial Computation Based on the BlockchainIEEE Transactions on Services Computing10.1109/TSC.2021.305477215:5(2795-2808)Online publication date: 1-Sep-2022
https://doi.org/10.1109/TSC.2021.3054772
Schabhüser LButin DBuchmann J(2019)Function-Dependent Commitments from Homomorphic AuthenticatorsInformation Security and Privacy10.1007/978-3-030-21548-4_22(399-418)Online publication date: 30-May-2019
https://doi.org/10.1007/978-3-030-21548-4_22
Show More Cited By

Index Terms

Generalized homomorphic MACs with efficient verification
1. General and reference
  1. Cross-computing tools and techniques
    1. Verification
2. Security and privacy
  1. Security services
    1. Authentication
  2. Systems security
    1. Operating systems security

Recommendations

Multi-Key Homomorphic MACs with Efficient Verification for Quadratic Arithmetic Circuits
ASIA CCS '22: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security

Multi-key homomorphic MACs (MKHomMACs) allow multiple clients to authenticate data with their own secret keys and outsource their data together with the tags to an untrusted server. Upon receiving any user 's request of computing a function on the data, ...
Privacy-Preserving Homomorphic MACs with Efficient Verification
Web Services – ICWS 2018
Abstract
Homomorphic Message Authentication Code (MAC) allows a user to outsource data to an untrusted server and verify that results of computation on the data returned by the server are correct. Recently, much effort has been independently focused on ...
Efficient revocable identity-based encryption from multilinear maps

In Identity-Based Encryption IBE systems, there is a widespread concern over the issue on how to provide an efficient revocation mechanism. We develop a new approach in constructing an efficient revocable IBE scheme. Our approach utilizes recent ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ASIAPKC '14: Proceedings of the 2nd ACM workshop on ASIA public-key cryptography

June 2014

66 pages

ISBN:9781450328012

DOI:10.1145/2600694

Program Chairs:
Keita Emura
National Institute of Information and Communications Technology, Japan
,
Goichiro Hanaoka
National Institute of Advanced Industrial Science and Technology, Japan
,
Yunlei Zhao
Fudan University, China

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 June 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ASIA CCS '14

Sponsor:

SIGSAC

ASIA CCS '14: 9th ACM Symposium on Information, Computer and Communications Security

June 3, 2014

Kyoto, Japan

Acceptance Rates

ASIAPKC '14 Paper Acceptance Rate 6 of 22 submissions, 27%;

Overall Acceptance Rate 36 of 103 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
216
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Feng SZhang L(2023)An Efficient Method for Realizing Contractions of Access Structures in Cloud StorageIEEE Transactions on Services Computing10.1109/TSC.2023.332589416:6(4481-4492)Online publication date: Nov-2023
https://doi.org/10.1109/TSC.2023.3325894
Guan YZheng HShao JLu RWei G(2022)Fair Outsourcing Polynomial Computation Based on the BlockchainIEEE Transactions on Services Computing10.1109/TSC.2021.305477215:5(2795-2808)Online publication date: 1-Sep-2022
https://doi.org/10.1109/TSC.2021.3054772
Schabhüser LButin DBuchmann J(2019)Function-Dependent Commitments from Homomorphic AuthenticatorsInformation Security and Privacy10.1007/978-3-030-21548-4_22(399-418)Online publication date: 30-May-2019
https://doi.org/10.1007/978-3-030-21548-4_22
Schabhüser LButin DDemirel DBuchmann J(2018)Function-Dependent Commitments for Verifiable Multi-party ComputationDevelopments in Language Theory10.1007/978-3-319-99136-8_16(289-307)Online publication date: 15-Aug-2018
https://doi.org/10.1007/978-3-319-99136-8_16
Demirel DSchabhüser LBuchmann JDemirel DSchabhüser LBuchmann J(2017)Analysis of the State of the ArtPrivately and Publicly Verifiable Computing Techniques10.1007/978-3-319-53798-6_8(49-56)Online publication date: 29-Mar-2017
https://doi.org/10.1007/978-3-319-53798-6_8
Demirel DSchabhüser LBuchmann JDemirel DSchabhüser LBuchmann J(2017)Homomorphic AuthenticatorsPrivately and Publicly Verifiable Computing Techniques10.1007/978-3-319-53798-6_5(27-35)Online publication date: 29-Mar-2017
https://doi.org/10.1007/978-3-319-53798-6_5

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents