Paper 2024/1788
Advanced Transparency System
, Imperial College London, Shanghai Jiao Tong UniversityAbstract
In contemporary times, there are many situations where users need to verify that their information is correctly retained by servers. At the same time, servers need to maintain transparency logs. Many algorithms have been designed to address this problem. For example, Certificate Transparency (CT) helps track certificates issued by Certificate Authorities (CAs), while CONIKS aims to provide key transparency for end users. However, these algorithms often suffer from either high append time or imbalanced inclusion-proof cost and consistency-proof cost. To find an optimal solution, we constructed two different but similar authenticated data structures tailored to two different lookup protocols. We propose ATS (Advanced Transparency System), which uses only linear storage cost to reduce append time and balances the time costs for both servers and users. When addressing the value-lookup problem, this system allows servers to append user information in constant time and enables radical-level inclusion proof and consistency proof. For the key transparency problem, the system requires logarithmic time complexity for the append operation and offers acceptable inclusion proof and consistency proof.
Metadata
- Available format(s)
-
PDF
- Category
- Applications
- Publication info
- Preprint.
- Keywords
- key managementtransparency logauthenticated data structuremerkle treechunking
- Contact author(s)
-
sunyxedu @ gmail com
huyuncong @ sjtu edu cn
yuyu @ cs sjtu edu cn - History
- 2024-11-04: approved
- 2024-11-01: received
- See all versions
- Short URL
- https://ia.cr/2024/1788
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1788,
author = {Yuxuan Sun and Yuncong Hu and Yu Yu},
title = {Advanced Transparency System},
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1788},
year = {2024},
url = {https://eprint.iacr.org/2024/1788}
}
