NDLI: Aggregating Symmetric/Asymmetric Attestations

Content Provider	IEEE Xplore Digital Library
Author	Huafei Zhu Feng Bao
Copyright Year	2008
Description	Author affiliation: Inst. for Infocomm Res., Singapore (Huafei Zhu; Feng Bao)
Abstract	The computation complexity and communication complexity are two prime factors related to energy consumptions of an RFID system. Since the larger bits of communication and computation need higher energy consumption, it is certainly welcome if the computation complexity and communication complexity of an RFID system are low while security and privacy of the system are achieved in a desired level. This leaves an interesting research problem when an RFID is used for identifying tags: given $sigma_{i}=(m_{i},$ $id_{i},$ $f(k_{i},$ $m_{i},$ $id_{i})),$ where f is a cryptographic primitive (say, a message authentication code, or a digital signature scheme), and $k_{i}$ is a secret key shared between tag $T_{i}$ and a processor P (i = $1,^{...}$ ,1), we ask whether there exists an efficient polynomial time algorithm g such that on input $f(k_{i},$ $m_{i}),$ it outputs an aggregate of message authentication codes (or signatures) T (T $=^{Delta}$ $g(f(k_{1},$ $m_{1}),^{...},$ $f(k_{l},$ $m_{l})))$ such that the size of T is independent of I while the computation complexity of g is as lower as possible; furthermore, the validity of individual attestation can be checked efficiently given T? Since an attestation can be produced by a message authentication scheme or a digital signature scheme, we consider the following two cases separately: - Aggregating symmetric attestations (or message authentication codes): we define $g(f(k_{1},$ $m_{1}),$ , $f(k_{l},$ $m_{l}))=$ $f(k_{1},$ $m_{1})$ otimes $^{...}$ otimes $f(k_{l},$ $m_{l}),$ where f is any secure message authentication algorithm and otimes is a simple operator suitable for software implementation (e.g., XORing, modulo addition and multiplication). - Aggregating asymmetric attestations (or digital signatures): we define a function g for aggregating asymmetric attestations that is admissible to the algebraic structure of underlying one-way functions and otimes is a simple operator suitable for software implementation (e.g., XORing, modulo addition and multiplication). We show that 1) assuming the existence of a cryptographically secure message authentication code, there exists efficient implementation of aggregate symmetric-attestation protocols; and 2) assuming the RSA problem is hard, there exists efficient yet secure implementation of aggregate asymmetric-attestation protocols.
Starting Page	105
Ending Page	110
File Size	264097
Page Count	6
File Format	PDF
ISBN	9781424417117
DOI	10.1109/RFID.2008.4519379
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-04-16
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Energy consumption Privacy Aggregates Complexity theory Cryptography Communication system security Message authentication Digital signatures Radiofrequency identification Cryptographic protocols
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in