Skip navigation
  • 中文
  • English

DSpace CRIS

  • DSpace logo
  • Home
  • Research Outputs
  • Researchers
  • Organizations
  • Projects
  • Explore by
    • Research Outputs
    • Researchers
    • Organizations
    • Projects
  • Communities & Collections
  • SDGs
  • Sign in
  • 中文
  • English
  1. National Taiwan Ocean University Research Hub
  2. 電機資訊學院
  3. 資訊工程學系
Please use this identifier to cite or link to this item: http://scholars.ntou.edu.tw/handle/123456789/25514
Title: A Revocable Certificateless Sanitizable Signature Scheme With Batch Verification
Authors: Lin, Han-Yu 
Tsai, Tung-Tso 
Wu, Hsu-Lun
Keywords: Public key;Digital signatures;Symbols;Generators;Probabilistic logic;Medical services;Computational modeling;Batch production systems;Data integrity;Data privacy;Digital signature;sanitizable;certificateless;revocation;batch
Issue Date: 2024
Publisher: IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Journal Volume: 12
Start page/Pages: 143392-143400
Source: IEEE ACCESS
Abstract: 
In medical and healthcare application scenarios, data integrity and user privacy are often concerned the most. A sanitizable signature scheme is a common adopted approach since it admits an authorized person to sanitize partial sensitive information of signed messages while keeping the correctness of preserved message and signature pairs. A certificateless sanitizable signature scheme further enjoys the merits of certificateless public key systems. That is, it is unnecessary to maintain the public key certificates in traditional cryptosystems or deal with the key escrow problem in identity-based systems. However, the functionality of batch verification for retained message-signature pairs and the revocation mechanism are still lack in previous works. To resolve these issues, the authors propose a revocable certificateless sanitizable signature scheme with batch verification in this paper. The revocation mechanism is fulfilled by combining user's private key with an updatable time key. Hence, a revoked user is unable to request the renewed time key. We also provide a formal proof that our proposed system satisfies the security requirement of existential unforgeability under adaptive chosen-message attacks (EUF-CMA) in the random oracle model. In comparison to related variants, our system demonstrates superior functionality and computational efficiency.
URI: http://scholars.ntou.edu.tw/handle/123456789/25514
ISSN: 2169-3536
DOI: 10.1109/ACCESS.2024.3460423
Appears in Collections:資訊工程學系

Show full item record

Page view(s)

73
checked on Jun 30, 2025

Google ScholarTM

Check

Altmetric

Altmetric

Related Items in TAIR


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Explore by
  • Communities & Collections
  • Research Outputs
  • Researchers
  • Organizations
  • Projects
Build with DSpace-CRIS - Extension maintained and optimized by Logo 4SCIENCE Feedback