IP Library › Granted Patent US 12,665,770
Granted Patent B2
US 12,665,770 · App. 18/341,901 · Granted Jun 23, 2026

System and method for cryptographic forensic audits on lightweight IoT and digital archives

Inventors: Attila A. Yavuz (Tampa, FL); Saif Eddine Nouma (Lutz, FL)
Assignee: University of South Florida
H04L9/3247G16Y30/10H04L41/069
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,665,770
App. No.
18/341,901
Filed
Jun 27, 2023
Granted
Jun 23, 2026
Kind
B2
Art Unit
2447
USPC
713/176
Abstract

A new series of secure logging schemes that are referred to as Optimal Signatures for secure Logging (OSLO) are created. OSLO schemes are the first AS-based secure logging schemes that achieve small-constant tag and public key sizes with near-optimal signing and batch verification via various granularities. These features make them ideal for IoT-STaaS applications, wherein efficient signing and batch verification are critical for the resource-limited IoTs and cold storage servers, respectively.

Claims (64)

1 . A system for cryptographic verifiability comprising:

a plurality of logger devices;

at least one distiller device; and

at least one cold storage server, wherein each logger device is adapted to:

generate a log, wherein the log comprises a plurality of entries and each entry is associated with a digital signature;

generate an aggregate signature for the log based on the digital signature associated with each entry, wherein the aggregate signature is an elliptic-curve based aggregate signature generated using one-time keys derived from a tree-based structure comprising a binary tree having a root seed from which child seeds are derived using pseudorandom function chains along tree paths of the tree-based structure;

provide the generated log and the aggregate signature to the at least one distiller device, wherein the at least one distiller device is adapted to:

receive a log from each of the logger devices, and for each received log from a logger device:

validate each entry in the log using the associated digital signature;

for each entry in the log that is validated:

batch the validated entries and associated digital signatures;

provide the batched validated entries to the at least one cold storage server;

for each entry in the log that is not validated:

batch the not validated entries and associated digital signatures; and

provide the batched not validated entries to the at least one cold storage server; and

wherein the at least one cold storage server is adapted to:

receive the batched validated and not validated entries;

audit at least some of the batched validated entries using a public key associated with the at least one distiller device; and

allow one or more external users to view the batched validated and not validated entries.

2 . The system of claim 1 , wherein each logger of the plurality of loggers is an internet-of-things device.

3 . The system of claim 1 , wherein the at least one distiller device is adapted to, for each received log from a logger device:

receive a public key associated with the at logger device; and

validate each entry in the log using the aggregated digital signature and the received public key.

4 . The system of claim 1 , wherein the distiller adapted to provide the batched validated entries to the at least one cold storage server comprises the distiller adapted to generate an aggregated digital signature for the batched validated entries, and provide the generated digital signature with the batched validated entries.

5 . A method for cryptographic verifiability comprising:

generating a log by a logger device of a plurality of logger devices, wherein the log comprises a plurality of entries and each entry is associated with a digital signature;

generating an aggregate signature for the log based on the digital signature associated with each entry by the logger device, wherein the aggregate signature is an elliptic-curve based aggregate signature generated using one-time keys derived from a tree-based structure comprising a binary tree having a root seed from which child seeds are derived using pseudorandom function chains along tree paths of the tree-based structure;

providing the generated log and the aggregate signature to at least one distiller device by the logger device;

receiving the log from the logger device by the at least one distiller device;

validating each entry in the log using the associated digital signature by the at least one distiller device;

for each entry in the log that is validated:

batching the validated entries and associated digital signatures by the at least one distiller device; and

providing the batched validated entries to at least one cold storage server by the at least one distiller device;

for each entry in the log that is not validated:

batching the not validated entries and associated digital signatures by the at least one distiller device; and

providing the batched not validated entries to the at least one cold storage server by the at least one distiller device;

receiving the batched validated and not validated entries by the at least one cold storage server;

auditing at least some of the batched validated entries by the at least one cold storage server; and

allowing one or more external users to view the batched validated and not validated entries by the at least one cold storage server.

6 . The method of claim 5 , wherein each logger of the plurality of loggers is an internet-of-things device.

7 . The method of claim 5 , further comprising:

receiving a public key associated with the at logger device; and

validating each entry in the log using the aggregated digital signature and the received public key.

8 . The method of claim 5 , wherein the logger generates the aggregate signature using a tree-based seed data structure.

9 . The method of claim 5 , further comprising generating an aggregated digital signature for the batched validated entries, and providing the generated digital signature with the batched validated entries.

10 . A non-transitory computer-readable medium with computer-executable instructions stored thereon that when executed by one or more computing devices cause the one or more computing devices to perform a method comprising:

generating a log by a logger device of a plurality of logger devices, wherein the log comprises a plurality of entries and each entry is associated with a digital signature;

generating an aggregate signature for the log based on the digital signature associated with each entry by the logger device, wherein the aggregate signature is an elliptic-curve based aggregate signature generated using one-time keys derived from a tree-based structure comprising a binary tree having a root seed from which child seeds are derived using pseudorandom function chains along tree paths of the tree-based structure;

providing the generated log and the aggregate signature to at least one distiller device by the logger device;

receiving the log from the logger device by the at least one distiller device;

validating each entry in the log using the associated digital signature by the at least one distiller device;

for each entry in the log that is validated:

batching the validated entries and associated digital signatures by the at least one distiller device; and

providing the batched validated entries to at least one cold storage server by the at least one distiller device;

for each entry in the log that is not validated:

batching the not validated entries and associated digital signatures by the at least one distiller device; and

providing the batched not validated entries to the at least one cold storage server by the at least one distiller device;

receiving the batched validated and not validated entries by the at least one cold storage server;

auditing at least some of the batched validated entries by the at least one cold storage server; and

allowing one or more external users to view the batched validated and not validated entries by the at least one cold storage server.

11 . The computer-readable medium of claim 10 , wherein each logger of the plurality of loggers is an internet-of-things device.

12 . The computer-readable medium of claim 10 , further comprising:

receiving a public key associated with the at logger device; and

validating each entry in the log using the aggregated digital signature and the received public key.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 21, 2023
From: YAVUZ, ATTILA A.; NOUMA, SAIF EDDINE
To: UNIVERSITY OF SOUTH FLORIDA
Reel/Frame 064337/0527 →
Continuity (2)
Provisional Application 63356792 · Jun 29, 2022
Related Publication 20240007300A1 · Jan 4, 2024
References Cited (67)
US 8230329B2 · Rohan · 2012 [cited by examiner]
US 10587416B1 · Yavuz · 2020 [cited by applicant]
US 20090193256A1 · Takenaka · 2009 [cited by examiner]
US 20140096135A1 · Kundu · 2014 [cited by examiner]
US 20140136707A1 · Beaty · 2014 [cited by examiner]
US 20140222813A1 · Yang · 2014 [cited by examiner]
US 20180013824A1 · Knopf · 2018 [cited by examiner]
US 20190044726A1 · Macieira · 2019 [cited by examiner]
US 20200396081A1 · Ansel · 2020 [cited by examiner]
US 20210258168A1 · Decoux · 2021 [cited by examiner]
US 20230090190A1 · Iila · 2023 [cited by examiner]
Alzain et al., “Cloud Computing Security: From Single to Multi-Clouds,” 2012 45th Hawaii International Conference on System Sciences, Jan. 4, 2012, pp. 5490-5499. [cited by applicant]
Amanullah et al., “Deep learning and big data technologies for IoT security,” Computer Communications, Feb. 1, 2020, vol. 151, pp. 495-517. [cited by applicant]
American Bankers Association, ANSI X9.62-1998: Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1999. [cited by applicant]
Armbrust et al., “A view of cloud computing,” Communications of the ACM, Apr. 1, 2010, vol. 53, No. 4, pp. 50-58. [cited by applicant]
Aumasson et al., “BLAKE2: simpler, smaller, fast as MD5,” Applied Cryptography and Network Security: 11th International Conference, Jun. 25-28, 2013, Proceedings 11, pp. 119-135. [cited by applicant]
Bairavasundaram et al., “An Analysis of Data Corruption in the Storage Stack,” ACM Transactions on Storage (TOS), Nov. 24, 2008, vol. 4, No. 3, pp. 1-28. [cited by applicant]
Bairavasundaram et al., “An Analysis of Latent Sector Errors in Disk Drives,” Proceedings of the 2007 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Jun. 12, 2007, pp. 289-300. [cited by applicant]
Balakrishnan et al., “Pelican: A Building Block for Exascale Cold Data Storage,” 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14), 2014, pp. 351-365. [cited by applicant]
Barreto et al., “Fast hashing onto elliptic curves over fields of characteristic 3,” Cryptology ePrint Archive, 2001, 11 pages. [cited by applicant]
Bellare et al., “Fast Batch Verification for Modular Exponentiation and Digital Signatures,” Advances in Cryptology—EUROCRYPT'98: International Conference on the Theory and Application of Cryptographic Techniques, May 3… [cited by applicant]
Bellare et al., “Introduction to modern cryptography,” UCSD CSE Course, 2005, 1st edition, 2005, 283 pages. [cited by applicant]
Boneh et al., “Identity-Based Encryption from the Weil Pairing,” Annual International Cryptology Conference, Aug. 2, 2001, pp. 213-229. [cited by applicant]
Boneh et al., “Short Signatures from the Weil Pairing,” Journal of Cryptology, Sep. 2004, vol. 17, pp. 297-319. [cited by applicant]
Boyko et al., “Speeding up Discrete Log and Factoring Based Schemes via Precomputations,” International Conference on the Theory and Applications of Cryptographic Techniques, May 31, 1998, pp. 221-235. [cited by applicant]
Coron et al., “Boneh et al.'s k-Element Aggregate Extraction Assumption is Equivalent to the Diffie-Hellman Assumption,” Proceedings of the 9th International Conference on the Theory and Application of Cryptology (ASIAC… [cited by applicant]
Coron, J., “On the Exact Security of Full Domain Hash,” Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology Conference, Aug. 20-24, 2000, Proceedings 2000, 8 pages. [cited by applicant]
Costello et al., “FourQ : four-dimensional decompositions on a Q-curve over the Mersenne prime,” Advances in Cryptology—ASIACRYPT 2015, 2015, pp. 214-215. [cited by applicant]
Costello et al., “SchnorrQ: Schnorr signatures on fourQ,” MSR Tech Report, Jul. 2016, 5 pages. [cited by applicant]
Cronin et al., “On the Performance, Feasibility, and Use of Forward-Secure Signatures,” Proceedings of the 10th ACM Conference on Computer and Communications Security, Oct. 27, 2003, pp. 131-144. [cited by applicant]
Crosby et al., “Efficient Data Structures for Tamper-Evident Logging,” USENIX Security Symposium, Aug. 10, 2009, pp. 317-334. [cited by applicant]
Delgado-Mohatar et al., “An Energy-Efficient Symmetric Cryptography Based Authentication Scheme for Wireless Sensor Networks,” Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Sma… [cited by applicant]
Ducas et al., “Crystals-Dilithium: A Lattice-Based Digital Signature Scheme,” IACR Transactions on Cryptographic Hardware and Embedded Systems, Feb. 14, 2018, vol. 2018, pp. 238-268. [cited by applicant]
Goldreich et al., “How to Construct Random Functions,” Journal of the Association for Computing Machinery (JACM), Aug. 10, 1986, vol. 33, No. 4, pp. 792-807. [cited by applicant]
Hankerson et al., “Guide to Elliptic Curve Cryptography,” Encyclopedia of Cryptography, Security and Privacy, Springer, 2004, 332 pages. [cited by applicant]
Hartung, G., “Attacks on Secure Logging Schemes,” International Conference on Financial Cryptography and Data Security, Apr. 3, 2017, pp. 268-284. [cited by applicant]
Holt, J., “Logcrypt: Forward Security and Public Verification for Secure Audit Logs,” Proceedings of the 2006 Australasian Workshops on Grid Computing and E-Research, Jan. 1, 2006, vol. 54, pp. 203-211. [cited by applicant]
Itkis et al., “Forward-Secure Signatures with Optimal Signing and Verifying,” Advances in Cryptology—CRYPTO 2001: 21st Annual International Cryptology Conference, Aug. 19-23, 2001 Proceedings 21, pp. 332-354. [cited by applicant]
Kampanakis et al., “BAFi: a practical cryptographic secure audit logging scheme for digital forensics,” Security and Communication Networks, Nov. 25, 2015, vol. 8, No. 17, pp. 3180-3190. [cited by applicant]
Katz et al., “Aggregate Message Authentication Codes,” Cryptographers' Track at the RSA Conference, Apr. 8, 2008, pp. 155-169. [cited by applicant]
Levandoski et al., “Identifying Hot and Cold Data in Main-Memory Databases,” 2013 IEEE 29th International Conference on Data Engineering (ICDE), Apr. 8, 2013, pp. 26-37. [cited by applicant]
Ma et al., “A New Approach to Secure Logging,” ACM Transactions on Storage (TOS), Mar. 31, 2009, vol. 5, No. 1, pp. 1-21. [cited by applicant]
Ma et al., “Forward-Secure Sequential Aggregate Authentication,” 2007 IEEE Symposium on Security and Privacy (SP'07), May 20, 2007, pp. 86-91. [cited by applicant]
Ma, D., “Practical forward secure sequential aggregate signatures,” Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, Mar. 18, 2008, pp. 341-352. [cited by applicant]
Malkin et al., “Efficient Generic Forward-Secure Signatures With an Unbounded Number of Time Periods,” International Conference on the Theory and Applications of Cryptographic Techniques, Apr. 28, 2002, pp. 400-417. [cited by applicant]
Marson et al., “Even more practical secure logging: Tree-based seekable sequential key generators,” Computer Security—ESORICS 2014: 19th European Symposium on Research in Computer Security, Sep. 7-11, 2014, Proceedings … [cited by applicant]
Mu et al., “Compact Sequential Aggregate Signatures,” Proceedings of the 2007 ACM Symposium on Applied Computing, Mar. 11, 2007, pp. 249-253. [cited by applicant]
Nouma et al., “Practical Cryptographic Forensic Tools for Lightweight Internet of Things and Cold Storage Systems,” Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation, May 9, 2023… [cited by applicant]
Ozmen et al., “Energy-Aware Digital Signatures for Embedded Medical Devices,” 2019 IEEE Conference on Communications and Network Security (CNS), Jun. 10, 2019, pp. 55-63. [cited by applicant]
Pabbuleti et al., “Energy budget analysis for signature protocols on a self-powered wireless sensor node,” Radio Frequency Identification: Security and Privacy Issues: 10th International Workshop, Jul. 21-23, 2014, pp. … [cited by applicant]
Pinheiro et al., “Failure Trends in a Large Disk Drive Population,” FAST '07: 5th USENIX Conference on File and Storage Technologies, 2007, pp. 17-28. [cited by applicant]
Reyzin et al., “Better than BiBa: Short One-time Signatures with Fast Signing and Verifying,” Australasian Conference on Information Security and Privacy, Jun. 21, 2002, pp. 144-153. [cited by applicant]
Rivest et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, Feb. 1, 1978, vol. 21, No. 2, pp. 120-126. [cited by applicant]
Schneier et al., “Secure Audit Logs to Support Computer Forensics,” ACM Transactions on Information and System Security (TISSEC), May 1, 1999, vol. 2, No. 2, pp. 159-176. [cited by applicant]
Schnorr, C.P., “Efficient Signature Generation by Smart Cards,” Journal of Cryptology, Jan. 1991, vol. 4, pp. 161-174. [cited by applicant]
Schroeder et al., “Understanding disk failure rates: What does an MTTF of 1,000,000 hours mean to you?,” ACM Transactions on Storage (TOS), Oct. 1, 2007, vol. 3, No. 3, pp. 1-16. [cited by applicant]
Seyitoglu et al., “Compact and Resilient Cryptographic Tools for Digital Forensics,” 2020 IEEE Conference on Communications and Network Security (CNS), Jun. 29, 2020, pp. 1-9. [cited by applicant]
Shah et al., “Privacy-Preserving Audit and Extraction of Digital Contents,” Cryptology ePrint Archive, 2008, pp. 1-21. [cited by applicant]
Shoup, V., “A Proposal for an ISO Standard for Public Key Encryption,” Cryptology ePrint Archive, 2001, pp. 1-63. [cited by applicant]
Stinson, D., “Cryptography: Theory and Practice,” CRC/C&H, 2002, Second Edition, 573 pages. [cited by applicant]
Sun et al., “Efficient completely non-malleable and RKA secure public key encryptions,” Information Security and Privacy: 21st Australasian Conference, ACISP, Jul. 4-6, 2016, Proceedings 21, Part II, pp. 134-150. [cited by applicant]
Turan et al., “Status Report on the Second Round of the NIST Lightweight Cryptography Standardization Process,” National Institute of Standards and Technology Internal Report, Jul. 20, 2021, vol. 8369, No. 10.6028, 92 p… [cited by applicant]
Yavuz et al., “Efficient, Compromise Resilient and Append-only Cryptographic Schemes for Secure Audit Logging,” Financial Cryptography and Data Security: 16th International Conference, Feb. 27-Mar. 2, 2012, pp. 148-163. [cited by applicant]
Yavuz, A., “ETA: Efficient and Tiny and Authentication for Heterogeneous Wireless Systems,” Proceedings of the Sixth ACM Conference on Security and Privacy in Wireless and Mobile Networks, Apr. 17, 2013, pp. 67-72. [cited by applicant]
Yazuv et al., “BAF and FI-BAF: Efficient and Publicly Verifiable Cryptographic Schemes for Secure Logging in Resource-Constrained Systems,” ACM Transactions on Information and System Security (TISSEC), Jul. 1, 2012, vol… [cited by applicant]
Yazuv et al., “BAF: An Efficient Publicly Verifiable Secure Audit Logging Scheme for Distributed Systems,” 2009 Annual Computer Security Applications Conference, Dec. 7, 2009, pp. 219-228. [cited by applicant]
Zaverucha et al., “Short One-Time Signatures,” Advances in Mathematics of Communications, Jul. 31, 2011, vol. 5, No. 3, pp. 473-488. [cited by applicant]