Anonymous Deniable Predicate Authentication Scheme with Revocability

Hiroaki Anada
1+ and Yoshifumi Ueshige2
 

1University of Nagasaki, Nagasaki, Japan

anada@sun.ac.jp

2Nagasaki University, Nagasaki, Japan 

yueshige@nagasaki-u.ac.jp

 

Abstract

In authentication protocols, anonymity is for privacy, while deniability is for anti-forensics after completion of the protocols. We propose a syntax and security definitions of an anonymous deniable predicate authentication scheme with revocability (rADPA). This new cryptographic primitive is to attain revocation function and strong privacy guarantee with predicate authentication, where a predicate is a boolean function over attributes of participants. We also give a generic construction of our rADPA scheme. Our approach is to build-in the revocable attribute-based encryption scheme proposed by K.Yamada et al. (ESORICS2017) into the anonymous deniable predicate authentication scheme proposed by S.Yamada et al. (PKC2012). Finally, we discuss how our rADPA scheme can be instantiated by employing concrete building blocks in our generic construction.

Keywords: anonymous authentication, attribute, deniability, revocation

 

+: Corresponding author: Hiroaki Anada
Division of Computer Science, Graduate School of Regional Design and Creation, University of Nagasaki, 1-1-1, Manabino, Nagayo-cho, Nagasaki, 851-2195 Japan
Tel: +81-95-813-5500

 

Journal of Internet Services and Information Security (JISIS), 11(3): 1-15, August 2021

Received: May 23, 2021; Accepted: July 24, 2021; Published: August 31, 2021

DOI: 10.22667/JISIS.2021.08.31.001 [pdf]