Granted Patent
B2
US 12,380,253 · App. 18/331,366 · Granted Aug 5, 2025
Structured data folding with transmutations
Assignee:
NUTS HOLDINGS, LLC
G06F21/78G06F16/258G06F21/602G06F21/6227H04L9/0637H04L9/0643H04L9/085H04L9/0861H04L9/14H04L9/3226H04L9/3242H04L9/3247H04L63/0281H04L63/0442
View Patent ↗
Loading inventors, assignments & file history…
Abstract
A method of processing data includes at least one processor accessing a data storage unit, the data storage unit providing at least one input data object and at least one transmutation command to be performed on the at least one input data object. The at least one transmutation command operates in a forward mode on the at least one input data object to produce at least one output data object to be stored in a data storage unit.
Claims (24)
1. A data processing system comprising:
a memory configured to store a data storage structure, the data storage structure containing at least one data field including at least one input data object and at least one command field including a plurality of transmutation commands to be performed in a sequence specified in the data storage structure on a same one of the at least one input data object; and
at least one processor configured to:
access the data storage structure in the memory;
operate in a forward traversal where each of the plurality of transmutation commands in the specified sequence is operated in a forward mode and the specified sequence is performed in a forward order on the at least one input data object to produce at least one output data object; and
replace the at least one input data object in the at least one data field of the data storage structure with the at least one output data object while leaving the plurality of transmutation commands in the at least one command field of the data storage structure wherein the plurality of transmutation commands is configured to be applied to the at least one output data object to recover the at least one input data object.
2. The system of claim 1 , wherein the at least one processor is further configured to:
operate in a reverse traversal where each of the plurality of transmutation commands in the specified sequence is performed in a reverse mode and the specified sequence is performed in a reverse order on the at least one output data object to produce the at least one input data object; and
replace the at least one output data object in the data storage structure with the at least one input data object while leaving the plurality of transmutation commands in the data storage structure.
3. The system of claim 2 , wherein at least one of the plurality of transmutation commands operating in a reverse mode comprises processing the at least one input data object in the forward mode to produce a second at least one output data object and comparing the at least one output data object with the second at least one output data object to produce a verification result.
4. The system of claim 3 , wherein at least one of the plurality of transmutation commands operating in the reverse mode produces a verification failure and terminates the processing of the plurality of transmutation commands.
5. The system of claim 1 , wherein at least one of the plurality of transmutation commands, operating in the forward mode, requires at least one attribute to process the at least one input data object to produce at least one output data object.
6. The system of claim 5 , wherein at least one of the plurality of transmutation commands, operating in a reverse mode, requires the at least one attribute to process the at least one output data object to produce the at least one input data object.
7. The system of claim 6 , wherein at least one of the plurality of transmutation commands, operating in the reverse mode, requires the at least one attribute to process the at least one input data object to produce at least one output data object comprising a verification result.
8. The system of claim 5 , wherein the at least one processor generates the at least one attribute required by at least one of the plurality of transmutation commands operating in the forward mode to process the at least one input data object to produce at least one output data object.
9. The system of claim 5 , wherein the at least one processor is further configured to check the structure of the at least one attribute presented for use by at least one of the plurality of transmutation commands operating in the forward mode which requires the at least one attribute of a specific structure to process the at least one input data object to produce the at least one output data object.
10. The system of claim 9 , wherein the at least one processor is further configured to check the structure of at least one attribute presented for use by at least one of the plurality of transmutation commands operating in the reverse mode which requires the at least one attribute of a specific structure to process the at least one output data object to produce the at least one input data object.
11. The system of claim 1 , wherein at least one of the plurality of transmutation commands converts the data storage structure into a second data storage structure having a different structure than the first data storage structure.
12. The system of claim 11 , wherein at least one of the plurality of transmutation commands is a mobius transmutation command.
13. The system of claim 1 , wherein the data storage structure is provided as at least one input data object in a second data storage structure; and
the at least one processor is configured to access the second data storage structure to process the second data storage structure.
14. The system of claim 1 , wherein two or more consecutive transmutation commands of the plurality of transmutation commands form a dependent group; and
each transmutation command within the dependent group is processed in the same forward order operating in the forward traversal or a reverse traversal.
15. The system of claim 1 , wherein at least one of the plurality of transmutation commands is a variable lock transmutation command.
Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded Jul 7, 2023
From: AUH, YOON HO
To: NUTS HOLDINGS, LLC.
Reel/Frame 064187/0264 →
Continuity (5)
Provisional Application
62395084
· Sep 15, 2016
References Cited (323)
US 5715403A
· Stefik
· 1998
[cited by applicant]
US 6185684B1
· Pravetz et al.
· 2001
[cited by applicant]
US 6205549B1
· Pravetz
· 2001
[cited by applicant]
US 6249866B1
· Brundrett et al.
· 2001
[cited by applicant]
US 6324650B1
· Ogilvie
· 2001
[cited by applicant]
US 6823068B1
· Samid
· 2004
[cited by applicant]
US 6845449B1
· Carman et al.
· 2005
[cited by applicant]
US 6868159B2
· Leppek
· 2005
[cited by applicant]
US 6895392B2
· Stefik et al.
· 2005
[cited by applicant]
US 6976168B1
· Branstad et al.
· 2005
[cited by applicant]
US 7010570B1
· Boies et al.
· 2006
[cited by applicant]
US 7095850B1
· McGrew
· 2006
[cited by applicant]
US 7136859B2
· Lucovsky et al.
· 2006
[cited by applicant]
US 7197512B2
· Pharies et al.
· 2007
[cited by applicant]
US 7243157B2
· Levin et al.
· 2007
[cited by applicant]
US 7359517B1
· Rowe
· 2008
[cited by applicant]
US 7389529B1
· Enderwick et al.
· 2008
[cited by applicant]
US 7394470B2
· Nishimura et al.
· 2008
[cited by applicant]
US 7434052B1
· Rump
· 2008
[cited by examiner]
US 7441185B2
· Coulson et al.
· 2008
[cited by applicant]
US 7509492B2
· Boyen et al.
· 2009
[cited by applicant]
US 7539867B2
· Bolosky et al.
· 2009
[cited by applicant]
US 7587589B2
· England et al.
· 2009
[cited by applicant]
US 7593548B2
· Dharmarajan et al.
· 2009
[cited by applicant]
US 7624400B2
· Pharies et al.
· 2009
[cited by applicant]
US 7653876B2
· Ethier et al.
· 2010
[cited by applicant]
US 7715565B2
· Kimmel et al.
· 2010
[cited by applicant]
US 7762456B2
· England et al.
· 2010
[cited by applicant]
US 7765193B2
· Hirose
· 2010
[cited by applicant]
US 7779139B2
· Vishwanath et al.
· 2010
[cited by applicant]
US 7793099B2
· Peterson
· 2010
[cited by applicant]
US 7886364B2
· Douceur et al.
· 2011
[cited by applicant]
US 7890771B2
· England et al.
· 2011
[cited by applicant]
US 7945784B1
· Masinter et al.
· 2011
[cited by applicant]
US 7949720B2
· Vernal et al.
· 2011
[cited by applicant]
US 7979697B2
· Phillips et al.
· 2011
[cited by applicant]
US 8059815B2
· Lofgren et al.
· 2011
[cited by applicant]
US 8145900B2
· Launchbury et al.
· 2012
[cited by applicant]
US 8219821B2
· Zimmels et al.
· 2012
[cited by applicant]
US 8306920B1
· Lynch
· 2012
[cited by applicant]
US 8331560B2
· Boyen et al.
· 2012
[cited by applicant]
US 8347087B1
· Agrawal et al.
· 2013
[cited by applicant]
US 8370956B2
· Stefik et al.
· 2013
[cited by applicant]
US 8397068B2
· Shur et al.
· 2013
[cited by applicant]
US 8463776B2
· Dunbar et al.
· 2013
[cited by applicant]
US 8468345B2
· Auradkar
· 2013
[cited by examiner]
US 8561127B1
· Agrawal et al.
· 2013
[cited by applicant]
US 8625805B1
· Statica et al.
· 2014
[cited by applicant]
US 8656159B1
· Donahue
· 2014
[cited by applicant]
US 8683230B2
· England et al.
· 2014
[cited by applicant]
US 8694788B1
· Thomas
· 2014
[cited by examiner]
US 8812643B2
· Maine et al.
· 2014
[cited by applicant]
US 8826005B1
· Brichford
· 2014
[cited by applicant]
US 8831228B1
· Agrawal et al.
· 2014
[cited by applicant]
US 8832047B2
· Herbach et al.
· 2014
[cited by applicant]
US 8887254B2
· Spalka et al.
· 2014
[cited by applicant]
US 8954726B1
· Statica et al.
· 2015
[cited by applicant]
US 8972750B2
· Goel et al.
· 2015
[cited by applicant]
US 8978091B2
· Banti et al.
· 2015
[cited by applicant]
US 9009477B2
· Das
· 2015
[cited by applicant]
US 9077525B2
· Chandran et al.
· 2015
[cited by applicant]
US 9129095B1
· Lam et al.
· 2015
[cited by applicant]
US 9183406B2
· England
· 2015
[cited by examiner]
US 9191376B2
· Phillips, II et al.
· 2015
[cited by applicant]
US 9317715B2
· Schuette et al.
· 2016
[cited by applicant]
US 9378380B1
· Reid et al.
· 2016
[cited by applicant]
US 9390228B2
· Reid
· 2016
[cited by applicant]
US 9563783B2
· Szebeni et al.
· 2017
[cited by applicant]
US 9767317B1
· Chakrovorthy
· 2017
[cited by examiner]
US 9871772B1
· Weinstein et al.
· 2018
[cited by applicant]
US 20020041685A1
· McLoone et al.
· 2002
[cited by applicant]
US 20020094084A1
· Wasilewski et al.
· 2002
[cited by applicant]
US 20020161973A1
· Ulrich et al.
· 2002
[cited by applicant]
US 20020170053A1
· Peterka et al.
· 2002
[cited by applicant]
US 20020184485A1
· Dray, Jr. et al.
· 2002
[cited by applicant]
US 20030055666A1
· Roddy et al.
· 2003
[cited by applicant]
US 20030074482A1
· Chirstensen et al.
· 2003
[cited by applicant]
US 20050086661A1
· Monnie et al.
· 2005
[cited by applicant]
US 20050141555A1
· Ponticelli
· 2005
[cited by applicant]
US 20050213511A1
· Reece, Jr. et al.
· 2005
[cited by applicant]
US 20070113095A1
· Marui et al.
· 2007
[cited by applicant]
US 20070174303A1
· Fleming et al.
· 2007
[cited by applicant]
US 20080091606A1
· Grecia
· 2008
[cited by applicant]
US 20080091699A1
· Nakashima
· 2008
[cited by applicant]
US 20080097786A1
· Sachdeva
· 2008
[cited by applicant]
US 20080155690A1
· Broshy
· 2008
[cited by applicant]
US 20080248782A1
· Stiers
· 2008
[cited by applicant]
US 20090093312A1
· Carlson
· 2009
[cited by applicant]
US 20100173610A1
· Kitazoe et al.
· 2010
[cited by applicant]
US 20100174664A1
· Schwaab et al.
· 2010
[cited by applicant]
US 20130060705A1
· Lynch
· 2013
[cited by applicant]
US 20140025719A1
· Kalinkin
· 2014
[cited by applicant]
US 20140195804A1
· Hursti
· 2014
[cited by examiner]
US 20140245025A1
· Fairless
· 2014
[cited by applicant]
US 20160028735A1
· Francis et al.
· 2016
[cited by applicant]
US 20160261413A1
· Kirsch
· 2016
[cited by applicant]
US 20160275461A1
· Sprague
· 2016
[cited by examiner]
US 20170208049A1
· Hu
· 2017
[cited by applicant]
US 20170230175A1
· Feliciano
· 2017
[cited by examiner]
CA 3017858
· 2017
[cited by applicant]
CN 100571132C
· 2009
[cited by applicant]
CN 105207774
· 2015
[cited by applicant]
CN 105743958
· 2016
[cited by applicant]
CN 105930236
· 2016
[cited by applicant]
JP 2015511050A
· 2015
[cited by applicant]
TW 201342867
· 2013
[cited by applicant]
TW 201539241A
· 2015
[cited by applicant]
TW 201608883
· 2016
[cited by applicant]
WO WO2006103777A1
· 2006
[cited by applicant]
WO WO2016077219A1
· 2016
[cited by examiner]
WO 2017114103A1
· 2017
[cited by applicant]
Korean Office Action in Application No. 10-2022-7033687, dated Jun. 14, 2023.
[cited by applicant]
JapenseOffice Action in Application No. 2022-077448, dated Jul. 18, 2023.
[cited by applicant]
Chinese Office Action in Application No. 201780053634.5, dated Jul. 5, 2023.
[cited by applicant]
U.S. Appl. No. 17/232,929 (Captured Aug. 15, 2023).
[cited by applicant]
Bernhard Amann et al., “IgorFs: A Distributed P2P File System”, Proc. of the 8th IEEE Intl. Conference on Peer-to-Peer Computing, Sep. 8-11, 2008, Aachen, Germany.
[cited by applicant]
Bernhard Amann et al., “Cryptographically Enforced Permissions for Fully Decentralized File Systems”, Proc. of the 10th IEEE Intl. Conference on Peer-to-Peer Computing, 2010.
[cited by applicant]
Christian D. Jensen, “CryptoCache: A Secure Sharable File Cache for Roaming Users”, EW 9 Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system, pp. 73-78…
[cited by applicant]
Anthony Harrington et al., “Cryptographic Access Control in a Distributed File System”, SACMAT'03, Jun. 1-4, 2003, Como, Italy.
[cited by applicant]
Kendy Kutzner, “The Decentralized File System Igor-FS as an Application for Overlay-Networks”, Doctoral Dissertation Universit at Fridericiana zu Karlsruhe, Feb. 14, 2008, Karlsruhe, Baden-Württemberg, Germany.
[cited by applicant]
Kendy Kutzner et al., “The Igor File System and Beyond”, Slide show presentation, Peer-to-Peer Technology in Grid Computing, Apr. 2008, Germany.
[cited by applicant]
Tom Lyons, “The Book of Fermat”, May 2017, www.fermat.org.
[cited by applicant]
Luis Fernando Molina, “Introducing the Graphchain”, Mar. 10, 2017, Medium, https://hackernoon.com/introducing-the-graphchain-2d20513bf713.
[cited by applicant]
Luis Fernando Molina et al., “Internet of People: A Public and Open Peer-to-Peer Network of People”, Mar. 2017, www.fermat.org.
[cited by applicant]
Luis Fernando Molina et al., “Fermat: A Modular App Platform to Develop ‘Internet of People’ Apps”, Aug. 2016, www.fermat.org.
[cited by applicant]
Luis Fernando Molina, “Fermat, the Internet of People and the Person to Person Economy”, Medium, Nov. 18, 2016, https://hackernoon.com/fermat-the-internet-of-people-and-the-person-to-person-economy-ce933865a0b0.
[cited by applicant]
Odni, “XML Data Encoding Specification for Trusted Data Format”, Sep. 6, 2013, Intelligence Community Technical Specification, Version 3, USA.
[cited by applicant]
Virtru, “Client-Side Data Protection with Virtru Encryption as a Service (EaaS)”, © 2016 Virtru Corporation, www.virtru.com.
[cited by applicant]
Docker “What is Docker?”, as early as 2013, 8 pages, www.docker.com.
[cited by applicant]
A. Armando et al., “Content-based Information Protection and Release in NATO Operations”, SACMAT 2013, Amsterdam, Netherlands.
[cited by applicant]
Simson Garfinkel et al., “Practical Unix & Internet Security, 3rd Edition”, Mar. 3, 2003, chap 4,6,7,10 pp. 128,438,606, O'Reilly Media, Sebastopol, CA, USA.
[cited by applicant]
Ladar Levison, “Dark Internet Mail Environment (DIME): Architecture and Specifications”, Mar. 2015, www.darkmail.info.
[cited by applicant]
Tuomas Lukka et al., “GZigZag—A Platform for Cybertext Experiments”, as early as Aug. 25, 2000, http://www.nongnu.org/gzz/ct/ct.html.
[cited by applicant]
Jacob Strauss et al., “Eyo: Device-Transparent Personal Storage”, 2011 USENIX Annual Technical Conference, Jun. 15-17, 2011, Portland, OR, USA.
[cited by applicant]
Jacob Strauss et al., “Device Transparency: a New Model for Mobile Storage”, Oct. 11, 2009, Presentation slides, SOSP Workshop on Hot Topics in Storage and File Systems (HotStorage '09), Big Sky, MT, USA.
[cited by applicant]
Jacob Strauss et al., “Device-Transparent Personal Storage”, Jun. 17, 2011, Quanta Research Cambridge presentation slides, MIT, Yale, USA.
[cited by applicant]
Andreas M. Antonopoulos, “Mastering Bitcoin: Unlocking Digital Cryptocurrencies”, Dec. 20, 2014, chap 2,4,7,10, O'Reilly Media, Sebastopol, CA, USA.
[cited by applicant]
Charles H. Bennett, “Notes on Landauer's principle, reversible computation, and Maxwell's Demon”, Studies in History and Philosophy of Modern Physics 34 (2003) 501-510, 2003, Elsevier Science Ltd., www.elsevier.com.
[cited by applicant]
Charles H. Bennett, “Logical Reversibility of Computation”, Nov. 1973, pp. 525-532, IBM J. Res. Develop., Yorktown Heights, NY, USA.
[cited by applicant]
Daniel J. Bernstein et al., “The security impact of a new cryptographic library”, Jul. 25, 2012, Progress in Cryptology—LatinCrypt 2012. LatinCrypt 2012. Lecture Notes in Computer Science, vol. 7533. Springer, Berlin, H…
[cited by applicant]
David Chaum et al., “cMix: Anonymization by High-Performance Scalable Mixing”, Feb. 23, 2016, 25th USENIX Security Symposium.
[cited by applicant]
Ralf Dragon et al., “Data Storage in Gentelligent Components: A New Way for Self-Authentication”, Sep. 2010, 2nd workshop Self-X in Engineering, Karlsruhe, Germany.
[cited by applicant]
Niels Ferguson et al., “Cryptography Engineering: Design Principles and Practical Applications”, Mar. 15, 2010, chap 15,18-21, Wiley Publishing, Indianapolis, Indiana, USA.
[cited by applicant]
Anthony Harrington, “Cryptographic Access Control for a Network File System”, Sep. 17, 2001, MS Dissertation, University of Dublin, Ireland.
[cited by applicant]
Satoshi Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System”, Oct. 31, 2008, www.bitcoin.org.
[cited by applicant]
Declan Patrick O'shanahan, “CryptosFS: Fast Cryptographic Secure NFS”, Sep. 15, 2000, MS Dissertation, University of Dublin, Ireland.
[cited by applicant]
Samsung Research America, “White Paper: Samsung KNOX Security Solution”, Feb. 2016, Samsung Electronics Co. Ltd., Korea.
[cited by applicant]
Samsung Enterprise Mobility Solutions, “White Paper: An Overview of the Samsung KNOX Platform”, Sep. 2015, Samsung Electronics Co. Ltd., Korea.
[cited by applicant]
Samsung Business, “Beyond basic Android: Security with Samsung KNOX”, 2015, Samsung Electronics Co. Ltd., Korea.
[cited by applicant]
Thomas Schwarz et al., “An Encrypted, Content Searchable Scalable Distributed Data Structure”, Apr. 3-7, 2006, pp. 1,2,5, 22nd International Conference on Data Engineering Workshops (ICDEW06), Atlanta, GA, USA.
[cited by applicant]
Symantec, “Symantec™ Encryption Desktop for Windows User's Guide 10.3”, Jan. 2014, pp. 79,128,180,182,188,189,202,207,217,224,235,240,245, Symantec Corporation, Mountain View, CA, USA.
[cited by applicant]
Simon Thyregod, “Key Management in Cryptographic Access Control”, Mar. 2, 2006, MS Thesis, Technical University of Denmark, Kongens Lyngby, Denmark.
[cited by applicant]
Vormetric, “Vormetric Encryption Architecture Overview: Protecting Enterprise Data at Rest with Encryption, Access Controls and Auditing”, 2012, Vormetric Inc., www.vormetric.com.
[cited by applicant]
Frank Wang et al., “Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds”, 2016, pp. 1-5,10, 13th USENIX Symposium on Networked Systems Design and Implementation (NSDI 16), Santa Clara, CA,…
[cited by applicant]
Ted Nelson “Project Xanadu”, as early as 1960, www.wikipedia.org.
[cited by applicant]
J. Chris Anderson et al., “CouchDB: The Definitive Guide, 1st Edition”, Jan. 2010, chap 2,12,16,17,22, O'Reilly Media, Sebastopol, CA, USA.
[cited by applicant]
Jacob Appelbaum et al., “Unlocking FileVault: An analysis of Apple's disk encryption system”, Dec. 29, 2006, 23rd Chaos Communication Congress, Germany.
[cited by applicant]
John Bethencourt et al., “Ciphertext-Policy Attribute-Based Encryption”, May 20-23, 2007, 2007 IEEE Symposium on Security and Privacy (SP '07), Berkeley, CA, USA.
[cited by applicant]
Dan Boneh et al., “Functional Encryption: Definition and Challenges”, 2011, Theory of Cryptography, TCC 2011, Lecture Notes in Computer Science, vol. 6597. Springer, Berlin, Heidelberg, Germany.
[cited by applicant]
Melissa Chase et al., “Structured Encryption and Controlled Disclosure”, 2010, Advances in Cryptology—AsiaCrypt 2010, AsiaCrypt 2010, Lecture Notes in Computer Science, vol. 6477, Springer, Berlin, Heidelberg, Germany.
[cited by applicant]
Jason Crampton, “Cryptographic Enforcement of Role-Based Access Control”, 2011, Formal Aspects of Security and Trust, Fast 2010, Lecture Notes in Computer Science, vol. 6561, Springer, Berlin, Heidelberg, Germany.
[cited by applicant]
Arkajit Dey et al., “Keyczar: A Cryptogrphic Toolkit”, as early as 2008, MIT, Google Research, www.google.com.
[cited by applicant]
Siyaram Gupta et al., “A Python Based Enhanced Secret Sharing Scheme to Secure Information using Cryptography Techniques”, 2014, International Journal of Advanced Science and Technology vol. 71 (2014), pp. 15-30, http:/…
[cited by applicant]
Michael Austin Halcrow, “eCryptfs: An Enterprise-class Cryptographic Filesystem for Linux”, 2005, 2005 Linux Symposium, Canada.
[cited by applicant]
Sandro Hawke, “Introduction to Linked Data”, Jun. 8, 2010, Presentation slideshow at Cambridge Semantic Web Gathering, Cambridge, MA, USA.
[cited by applicant]
Marc Jaimez et al., “A mechanism to avoid collusion attacks based on code passing in mobile agent systems”, 2009, Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks, WIST…
[cited by applicant]
M. Jones, “JSON Web Key (JWK)”, May 2015, Internet Engineering Task Force (IETF) Request for Comments: 7517.
[cited by applicant]
M. Jones, “JSON Web Algorithms (JWA)”, May 2015, Internet Engineering Task Force (IETF) Request for Comments: 7518.
[cited by applicant]
M. Jones et al., “JSON Web Encryption (JWE)”, May 2015, Internet Engineering Task Force (IETF) Request for Comments: 7516.
[cited by applicant]
M. Jones et al., “JSON Web Signature (JWS)”, May 2015, Internet Engineering Task Force (IETF) Request for Comments: 7515.
[cited by applicant]
Anne Voluntas Dei Massah Kayem, “Adaptive Cryptographic Access Control for Dynamic Data Sharing Environments”, Oct. 2008, chap 1,2,5, Doctoral Dissertation, Queen's University, Kingston, Ontario, Canada.
[cited by applicant]
Anne Voluntas Dei Massah Kayem et al., “Adaptive Cryptographic Access Control”, Aug. 16, 2010, chap 2,6, Advances in Information Security (Book 48), Springer Verlag, New York, NY, USA.
[cited by applicant]
Hugo Krawczyk, “Secret Sharing Made Short”, 1994, Advances in Cryptology—Crypto '93 LNCS 773, pp. 136-146, Springer-Verlag, Berlin, Heidelberg, Germany.
[cited by applicant]
Allison Lewko et al. “Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption”, 2010, Advances in Cryptology—EuroCrypt 2010. EuroCrypt 2010, Lecture Notes in Computer S…
[cited by applicant]
John Lyle, “Personal PKI for the smart device era”, 2012, Public Key Infrastructures, Services and Applications, EuroPKI 2012, Lecture Notes in Computer Science, vol. 7868, Springer, Berlin, Heidelberg, Germany.
[cited by applicant]
Network Associates, “PGP Freeware for Windows User's Guide version 7.0”, 2001, Network Associates Inc, Santa Clara, CA, USA.
[cited by applicant]
Jon Callas, “Introduction to Cryptography”, 2009, PGP Corporation, USA, www.pgp.com.
[cited by applicant]
Brent Waters, “Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization”, 2011, Public Key Cryptography—PKC 2011, PKC 2011, Lecture Notes in Computer Science, vol. 6571, Sp…
[cited by applicant]
Wire Swiss GmbH, “Wire Privacy Whitepaper”, Mar. 3, 2016, Wire Swiss GmbH, Germany, www.wire.com.
[cited by applicant]
Wire Swiss GmbH, “Wire Security Whitepaper”, Mar. 3, 2016, Wire Swiss GmbH, Germany, www.wire.com.
[cited by applicant]
M. Miller, “Examples of Protecting Content Using JSON Object Signing and Encryption (JOSE)”, May 2015, Internet Engineering Task Force (IETF) Request for Comments: 7520.
[cited by applicant]
WT SDK, Product Brief SDK functions; www.windtalkersercurity.com; 2016 Windtalker, LLC.
[cited by applicant]
WT Overview; www.windtalkersecurity.com; 2016 CoreGuard, LLC.
[cited by applicant]
WT Security Solution Brief; www.windtalkersecurity.com; CIO Magazine, Sep. 15, 2011.
[cited by applicant]
Business Wire; Windtalker Launches Cloud-Based Content Security Technology Today; Social Media Profiles; Oct. 30, 2018.
[cited by applicant]
FAQ Windtalker; Mar. 11, 2019.
[cited by applicant]
Windtalker Data Centric Security Infographic; ww.windtalkersecurity.com.
[cited by applicant]
Windtalker Vector Product Brief; www.windtalkersecurity.com; 2016 Windtalker, LLC.
[cited by applicant]
International Search Report issued in PCT/US2017/049661 dated Feb. 2, 2018.
[cited by applicant]
Written Opinion issued in PCT/US2017/049661 dated Feb. 2, 2018.
[cited by applicant]
European Search Report from EP Application No. 17851312.3 dated Apr. 6, 2020.
[cited by applicant]
Eurasian Office Action issued in Eurasian patent application No. 201990315 dated Apr. 22, 2020.
[cited by applicant]
Eurasian Office Action issued in Eurasian patent application No. 19179180.5 dated Nov. 30, 2020.
[cited by applicant]
Werner Vogels, “Eventually Consistent”, Communications of the ACM, Jan. 2009, pp. 40-44, vol. 52 No. 1, Association for Computing Machinery, USA.
[cited by applicant]
Vinton G. Cerf, “Half-Baked High-Resolution Referencing”, Feb. 2021, p. 7, vol. 64 No. 2, Association for Computing Machinery, USA.
[cited by applicant]
Paul V. Blessy et al., “Cryptographic File System for Secured Group Communication”, May 30, 2015, pp. 207-211, vol. 3, Issue-5, International Journal of Computer Sciences and Engineering, Indore, India.
[cited by applicant]
Fangbo Cai et al., “Survey of access control models and technologies for cloud computing”, Feb. 1, 2018, pp. 6111-6122, Cluster Comput 22, Springer Science+Business Media, LLC, part of Springer Nature 2018, Switzerland.
[cited by applicant]
Giuseppe Decandia et al., “Dynamo: Amazon's Highly Available Key-value Store”, SOSP'07, Oct. 14-17, 2007, pp. 205-220, Association for Computing Machinery, Stevenson, Washington, USA.
[cited by applicant]
Keiko Hashizume et al., “An analysis of security issues for cloud computing”, Journal of Internet Services and Applications, Feb. 27, 2013, 13 pages, SpringerOpen Journal, Switzerland.
[cited by applicant]
Mustaque Ahamad et al., “Replicated Data Management in Distributed Systems”, 1992, 32 pages, College of Computing, Georgia Institute of Technology, Atlanta, Georgia, USA.
[cited by applicant]
David Elliot Bell, “Looking Back at the Bell-La Padula Model”, Dec. 7, 2005, 15 pages, 21st Annual Computer Security Applications Conference (ACSAC'05), IEEE, USA.
[cited by applicant]
David Elliot Bell et al., “Secure Computer System: Unified Exposition and Multics Interpretation”, Mar. 1976, 134 pages, Prepared for the US Air Force, the MITRE Corporation, Bedford, MA, USA.
[cited by applicant]
Len Lapadula et al., “Secure Computer System: Mathematical Foundations”, Mar. 1973, 33 pages, MITRE Technical Report 2547, the MITRE Corporation, Bedford, MA, USA.
[cited by applicant]
Marc Shapiro et al., “A comprehensive study of Convergent and Commutative Replicated Data Types”, Research Report RR-7506, Jan. 13, 2011, 47 pages, INRIA, Paris, France.
[cited by applicant]
Anton Zagorskii, “CRDT: Conflict-free Replicated Data Types”, Web article, Aug. 6, 2018, www.medium.com, USA.
[cited by applicant]
Martin Kleppmann et al., “A Conflict-Free Replicated JSON Datatype”, CoRR, Aug. 2016, 17 pages, IEEE Transactions on Parallel and Distributed Systems PP(99), IEEE, USA.
[cited by applicant]
Marc Shapiro et al., “Conflict-free Replicated Data Types”, France SSS 2011—13th International Symposium Stabilization, Safety, and Security of Distributed Systems, Oct. 2011, pp. 386-400, Grenoble, France.
[cited by applicant]
Nuno Preguiça, “Conflict-free Replicated Data Types: An Overview”, Computing Research Repository (CoRR), Jun. 27, 2018, 41 pages, Cornell University and ACM, USA.
[cited by applicant]
Peter J. Denning et al., “The Profession of IT, the Long Quest for Universal Information Access”, Dec. 2010, pp. 34-36, vol. 53 No. 12, Association for Computing Machinery, USA.
[cited by applicant]
Jim Gray et al., “The Dangers of Replication and a Solution”, 1996 ACM SIGMOD Conference at Montreal, May 1996, pp. 173-182, Microsoft Research Technical Report MSR-TR-96-17, Association for Computing Machinery, USA.
[cited by applicant]
Martin Kleppmann, “A Critique of the CAP Theorem”, CoRR, Sep. 18, 2015, 14 pages, Cornell University, USA.
[cited by applicant]
Doug Cahill, “Before and After Next-gen: Cybersecurity Considerations that Transcend Paradigm Shifts”, ESG White Paper, Jan. 2017, 12 pages, the Enterprise Strategy Group, USA.
[cited by applicant]
Jianbing Ni et al., “Securing Fog Computing for Internet of Things Applications: Challenges and Solutions”, IEEE Communications Surveys & Tutorials, Oct. 12, 2017, pp. 601-628, vol. 20, No. 1, IEEE, USA.
[cited by applicant]
Mattia Antonini et al., “Fog Computing Architectures: a Reference for Practitioner”, IEEE Internet of Things Magazine, Sep. 2019, pp. 19-25, vol. 2, No. 3, IEEE, USA.
[cited by applicant]
Alberto Montresor, “Gossip and Epidemic Protocols”, Wiley Online Library, Aug. 15, 2017, 19 pages, Wiley, USA.
[cited by applicant]
Mark Jelasity, “Chapter 1: Gossip”, Self-Organising Software: From Natural to Artificial Adaptation, Natural Computing Series, 2011, pp. 139-162, Springer, Switzerland.
[cited by applicant]
Chip Sharp, “Overview of the Digital Object Architecture (DOA)”, An Internet Society Information Paper, Oct. 25, 2016, 8 pages, Internet Society, USA.
[cited by applicant]
Leslie Lamport, “The Part-Time Parliament”, ACM Transactions on Computer Systems, May 1998, pp. 133-169, vol. 16 No. 2, Association for Computing Machinery, USA.
[cited by applicant]
Rini Mahajan et al., “A Novel access control model in cloud computing environment (PAR-AC)”, International Journal of Engineering & Technology, 2018, pp. 1795-1800, vol. 7 No. 3, Science Publishing Corporation, UAE.
[cited by applicant]
Sunita Mahajan et al., “Security in Distributed Systems”, Distributed Computing 2
[cited by applicant]
Nami Nasserazad et al., “Practical Demystification of CRDTs”, Amsterdam.SCALA Meetup, Aug. 27, 2015, 59 slides, TomTom, Amsterdam, Netherlands.
[cited by applicant]
Leslie Lamport, “Paxos Made Simple”, ACM SIGACT News (Distributed Computing Column), Dec. 2001, pp. 51-58, vol. 32 No. 4, Association for Computing Machinery, USA.
[cited by applicant]
You-Jin Song et al., “Access Control Policy of Data Considering Varying Context in Sensor Fusion Environment of Internet of Things”, KIPS Tr. Software and Data Eng., Sep. 2015, pp. 409-418, vol. 4 No. 9, KTSDE, South Ko…
[cited by applicant]
Charles Byers et al., “OpenFog Reference Architecture for Fog Computing”, OpenFog Architecture Workgroup, Feb. 2017, 162 pages, OpenFog Consortium, USA.
[cited by applicant]
Michaela Iorga et al., “Fog Computing Conceptual Model: Recommendations of the National Institute of Standards and Technology”, NIST Special Publication 500-325, Mar. 2018, 14 pages, NIST, USA.
[cited by applicant]
Wikipedia, “Version Control”, Jun. 6, 2019, 9 pages, wikipedia.org, USA.
[cited by applicant]
Eric Sink, “Version Control by Example”, Jul. 2011, 226 pages, Pyrenean Gold Press, Champaign, Illinois, USA.
[cited by applicant]
Admin Protonmail, “The ProtonDrive security model”, Aug. 31, 2020, 15 pages, web article, Proton Technologies AG, Switzerland.
[cited by applicant]
Jon Loeliger et al., “Version Control with Git 2
[cited by applicant]
Michael Freedman, “Strong Consistency & Cap Theorem”, Oct. 7, 2016, 8 pages, lecture slides for COS-418 Fall 2016 Distributed Systems at Princeton University, Princeton, New Jersey, USA.
[cited by applicant]
Kyle Jamieson, “Eventual Consistency: Bayou”, Oct. 19, 2016, 12 pages, lecture slides for COS-418 Fall 2016 Distributed Systems at Princeton University, Princeton, New Jersey, USA.
[cited by applicant]
Australia Office Action in Application No. 2017325928, dated Jun. 22, 2021.
[cited by applicant]
Eurasian Office Action in Application No. 201990315, dated Jul. 22, 2021.
[cited by applicant]
Korean Office Action in Application No. 10-2019-7004510, dated Jul. 27, 2021.
[cited by applicant]
Japanese Office Action in Application No. 2019-515439, dated Sep. 28, 2021.
[cited by applicant]
Taiwanese Office Action in Application No. 11021017870, dated Oct. 21, 2021.
[cited by applicant]
European Office Action dated Dec. 16, 2021 issued in EP Application No. 1785132.
[cited by applicant]
Indian Office Action dated Nov. 16, 2021 issued in IN Application No. 201917012521.
[cited by applicant]
Japanese Notice of Allowance for Japanese Patent Application No. 2019-515439, dated Apr. 12, 2022.
[cited by applicant]
Taiwanese Notice of Allowance for Taiwan Patent Application No. 106131531, dated Jan. 21, 2022.
[cited by applicant]
Costa Rican Office Action for Costa Rica Patent Application No. 2019-000075, dated Feb. 8, 2002.
[cited by applicant]
Korean Notice of Allowance for Application No. 10-2019-7004510, dated Oct. 6, 2022.
[cited by applicant]
Mexican Office Action for Application No. MX/a/2019/002385, dated Sep. 30, 2022.
[cited by applicant]
Taiwanese Notice of Allowance for Taiwan Patent Application No. 111114996, dated Jan. 16, 2023.
[cited by applicant]
Costa Rican Office Action for Costa Rica Patent Application No. 2019-0000075, dated Jan. 11, 2023.
[cited by applicant]
Chinese Office Action in Chinese Patent Application No. 201780053634.5, dated Dec. 2, 2022.
[cited by applicant]
Brazilian Office Action in Brazil Patent Application No. 112019003128-6, dated Feb. 8, 2023.
[cited by applicant]
Eurasian Office Action for Eurasian Application No. 202291926, mailed Feb. 1, 2023.
[cited by applicant]
Informatics and computer technology. World Information Resources 5.8 Encryption and digital signature [online] Digital Library / [found webarchive.org Jan. 10, 2016]—found <http://libraryno.ru/5-8-shifrovanie-i-elektron…
[cited by applicant]
U.S. Appl. No. 17/232,903 From Feb. 9, 2023 to Apr. 11, 2023 Captured Apr. 21, 2023.
[cited by applicant]
U.S. Appl. No. 15/692,648, filed Aug. 31, 2017 electronically captured on Nov. 21, 2023.
[cited by applicant]
U.S. Appl. No. 15/692,584, filed Aug. 31, 2017 electronically captured on Nov. 21, 2023.
[cited by applicant]
U.S. Appl. No. 16/828,535, filed Mar. 24, 2020 captured on Nov. 21, 2023.
[cited by applicant]
U.S. Appl. No. 16/582,649, filed Sep. 24, 2019 electronically captured Nov. 21, 2023.
[cited by applicant]
U.S. Appl. No. 17/232,903, filed Apr. 16, 2021 electronically captured on Nov. 21, 2023.
[cited by applicant]
U.S. Appl. No. 17/213,932, filed Mar. 26, 2021 electronically captured on Nov. 21, 2023.
[cited by applicant]
U.S. Appl. No. 17/232,929, filed Apr. 16, 2021 electronically captured on Nov. 21, 2023.
[cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2017/049661, mailed Mar. 28, 2019, 15 Pages.
[cited by applicant]
International Preliminary Report on Patentability for International Application No. PCT/US2021/024356, mailed Oct. 20, 2022, 8 Pages.
[cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2021/024356, mailed Aug. 16, 2021, 18 Pages.
[cited by applicant]
Notice of Allowance for Mexican Application No. MX/A/2019/002385, mailed May 2, 2023, 6 Pages.
[cited by applicant]
Notice of Allowance for U.S. Appl. No. 16/582,649, mailed Jan. 13, 2021, 9 Pages.
[cited by applicant]
Office Action for Canadian Patent Application No. 3031531, mailed Oct. 17, 2023, 4 Pages.
[cited by applicant]
Office Action for Israel Application No. 269652, dated May 7, 2023, 4 Pages.
[cited by applicant]
Office Action for Australia Patent Application No. 20233204296, mailed Dec. 13, 2023, 4 pages.
[cited by applicant]
U.S. Appl. No. 18/331,366, Captured Feb. 20, 2024, 58 pages.
[cited by applicant]
Extended European Search Report for Application No. 21784876.1, dated Mar. 13, 2024, 8 Pages.
[cited by applicant]
Office Action for Eurasian Patent Application No. 202291926, mailed Apr. 19, 2024, 11 pages.
[cited by applicant]
Office Action for European Patent Application No. 21784876.1, mailed Apr. 4, 2024, 1 page.
[cited by applicant]
Second Examination Report for New Zealand Patent Application No. 750592, mailed Apr. 29, 2024, 10 pages.
[cited by applicant]
U.S. Appl. No. 18/331,366, Captured on May 24, 2024.
[cited by applicant]
Office Action for Canadian Patent Application No. 3031531, mailed Aug. 5, 2024, 6 pages.
[cited by applicant]
Office Action for European Patent Application No. 17851312.3, mailed Jun. 25, 2024, 7 pages.
[cited by applicant]
Office Action for Japanese Patent Application No. 2022-077448, mailed Jul. 9, 2024, 4 pages.
[cited by applicant]
Office Action for Saudi Arabian Application No. 522440862, mailed Jul. 24, 2024, 10 pages.
[cited by applicant]
Office Action for Taiwan Patent Application No. 110112691, mailed May 2, 2024, 8 pages.
[cited by applicant]
Office Action for Israel Patent Application No. 296952, mailed Dec. 18, 2024, 3 pages.
[cited by applicant]
Office Action for Taiwan Patent Application No. 110112691, mailed Dec. 23, 2024, 4 pages.
[cited by applicant]
Office Action for Taiwan Patent Application No. 112115495, mailed Dec. 20, 2024, 06 pages.
[cited by applicant]
Office Action for Canada Patent Application No. 3,173,624, mailed Jan. 9, 2025, 05 pages.
[cited by applicant]
Office Action for Korean Patent Application 10-2024-7008644, dated Nov. 25, 2024.
[cited by applicant]
Office Action for Israel Patent Application No. 310890, mailed Aug. 20, 2024, 4 pages.
[cited by applicant]
Office Action for Taiwan Patent Application No. 112115495, mailed Sep. 5, 2024, 12 pages.
[cited by applicant]
Office Action for Japanese Patent Application No. 2024066642, mailed Jan. 28, 2025, 3 pages.
[cited by applicant]
Examination Report for Indian Patent Application No. IN 202418040306, dated May 23, 2025, 12 pages.
[cited by applicant]
Office Action for Saudi Arabian Application No. 524462249, mailed Apr. 20, 2025, 13 pages.
[cited by applicant]
W3C., “Extensible Markup Language (XML) 1.0 (Fifth Edition),” W3C Recommendation, Nov. 26, 2008, 37 pages.
[cited by applicant]