Low-cost Anonymous Timed-Release Encryption

Hristu-Varsakelis, Dimitrios; Chalkias, Konstantinos; Stephanides, George

doi:10.1109/isias.2007.4299754

Cited by 7 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the recent TRE schemes are based on Identity-Based Encryption (IBE) [18] and bilinear map (e.g. [19]). In order to achieve efficient solutions, we avoid using expensive IBE-TRE schemes.…”

Section: Related Workmentioning

confidence: 99%

Hash-Based Sequential Aggregate and Forward Secure Signature for Unattended Wireless Sensor Networks

Yavuz

Ning

2009

Proceedings of the 6th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services

View full text Add to dashboard Cite

Unattended Wireless Sensor Networks (UWSNs) operating in hostile environments face great security and performance challenges due to the lack of continuous real-time communication between senders (sensors) and receivers (e.g., mobile data collectors, static sinks). The lack of real-time communication forces sensors to accumulate the sensed data possibly for long time periods, along with the corresponding signatures for authentication purposes. Moreover, non-real-time characteristic of UWSNs makes sensors vulnerable especially to active adversaries, which compromise sensors and extract all data stored in them. Hence, it is critical to have forward security property such that even if the adversary can compromise the current keying materials, she cannot modify or forge authenticated data generated before the node compromise. Forward secure and aggregate signatures are cryptographic primitives developed to address these issues. Unfortunately, existing forward secure and aggregate signature schemes either impose substantial computation and storage overhead, or do not allow public verifiability, thereby impractical for resource-constrained UWSNs. In order to address these problems, we propose a new class of signature schemes, which we refer to as Hash-Based 5..equential &gregate and Eorward Secure 5..ignature (HaSAFSS). Such a scheme allows a signer to sequentially generate a compact, fixedsize, and publicly verifiable signature at a nearly optimal computational cost. We propose two HaSAFSS schemes, Symmetric HaSAFSS (Sym-HaSAFSS) and Elliptic Curve Cryptography (ECC) based HaSAFSS (ECC-HaSAFSS). Both schemes integrate the efficiency of MAC-based aggregate signatures and the public verifiability of bilinear map based signatures by preserving forward security via Timed-Release Encryption (TRE). We demonstrate that our schemes are secure under appropriate computational assumptions. We also show that our schemes are significantly more efficient in terms of both computational and storage overheads than previous schemes, and therefore quite practical for even highly resource-constrained UWSN applications. Index Terms-Unattended Wireless Sensor Networks (UWSNs), security and privacy, digital signatures, forward security, signature aggregation. I. INTRODUCTION An Unattended Wireless Sensor Network (UWSN) [1]-[5] is a Wireless Sensor Network (WSN) in which continuous endto-end real-time communication is not possible for sensors (senders) and their receivers (e.g., mobile collectors, static sinks). In other words, receivers might not be available for sensors from time to time, sometimes for long time periods.

show abstract

Section: Related Workmentioning

confidence: 99%

Hash-Based Sequential Aggregate and Forward Secure Signature for Unattended Wireless Sensor Networks

Yavuz

Ning

2009

Proceedings of the 6th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services

View full text Add to dashboard Cite

show abstract

“…The Conditional Oblivious Transfer Protocol [9] was then proposed that provided anonymity to the content provider, but not the client during communication. Further approaches, such as New-TRE [23] propose non-authenticated, non-interactive server-based schema that may be implemented using multiple time-servers for further anonymity. This TA-based scheme is being manipulated for public-key encryption and non-interactive and secure server-client interaction across the Internet.…”

Section: Ii31 Timed-release Cryptology -An Alternative Ap-proachmentioning

confidence: 99%

Using timed-release cryptography to mitigate the preservation risk of embargo periods

Haq

Nelson

2009

Proceedings of the 9th ACM/IEEE-CS Joint Conference on Digital Libraries

View full text Add to dashboard Cite

“…In 1996, Rivest et al 4 first proposed two preliminary TRE construction schemes, the first is TLP scheme based on factorization problem, and the second is the sender issues time and message to the agent, which laid the theoretical foundation for the sustainable research of TRE. So far, the construction of TRE scheme includes TLP [5][6][7][8][9][10] , agents [11][12][13][14][15][16][17] and other methods [18][19][20][21][22][23] . In the TRE scheme constructed based on TLP, the decryption key is hidden in a mathematical formula.…”

Section: Introductionmentioning

confidence: 99%

Multiple Time Servers Timed-Release Encryption Based on Shamir Secret Sharing

Yuan

Cheng

Chen

et al. 2023

Preprint

View full text Add to dashboard Cite

Timed-release encryption (TRE) is a cryptographic primitive that can realize the data be decrypted and accessed only at a specified time in the future preset by the data sender. Currently, most TRE schemes adopt noninteractive single time server mode. However, once the single time server is attacked or corrupted, it is prone to directly threaten the TRE security application. Although there are some TRE schemes that "distribute" the single time server into multiple ones, there is a problem that they cannot resist single-point failure. For this reason, a multi-time server TRE scheme based on Shamir secret sharing and its variant scheme are proposed. In our proposed schemes, the ciphertext can be decrypted when the number of time trapdoors obtained by the data receiver exceeds or equals to the threshold. It can not only guarantee the security of data sender's identity privacy information, but also greatly improve the reliability of TRE. Security analysis shows that our schemes have data confidentiality, verifiability, anti-advance decryption and multi-time trapdoor robust decryption. Efficiency analysis shows that when choosing a reasonable threshold, the computational efficiency of our schemes is slightly improved compared with the existing multiple time servers TRE schemes.

show abstract

Low-cost Anonymous Timed-Release Encryption

Cited by 7 publications

References 19 publications

Hash-Based Sequential Aggregate and Forward Secure Signature for Unattended Wireless Sensor Networks

Hash-Based Sequential Aggregate and Forward Secure Signature for Unattended Wireless Sensor Networks

Using timed-release cryptography to mitigate the preservation risk of embargo periods

Multiple Time Servers Timed-Release Encryption Based on Shamir Secret Sharing

Contact Info

Product

Resources

About