Academic Journal
DaChE: a proof-of-concept for chaos-based database security with dynamic data motion.
| Τίτλος: | DaChE: a proof-of-concept for chaos-based database security with dynamic data motion. |
|---|---|
| Συγγραφείς: | Weinberg, Abraham Itzhak1 (AUTHOR) aviw2010@gmail.com |
| Πηγή: | International Journal of Information Security. Oct2026, Vol. 25 Issue 5, p1-10. 10p. |
| Θεματικοί όροι: | *Database security, *Data encryption, *Data security, *Distributed computing, *Advanced Encryption Standard, Benchmark problems (Computer science), Lyapunov exponents, Collision detection (Computer animation) |
| Περίληψη: | Database security remains fundamentally constrained by static defenses: fixed data locations and long-lived encryption keys give attackers a stationary target once perimeter defenses are breached. This paper makes three contributions toward an alternative, motion-based paradigm. First, we introduce the Database in Motion Chaos Encryption (DaChE) algorithm, in which AES-256-encrypted data shards are bound to balls that move through a Bunimovich stadium billiard, with decryption released only when a ball collides with a matching key-holding obstacle; a MapReduce-style pipeline aggregates the resulting partial query results. Second, we provide a proof-of-concept implementation and empirically validate the algorithm's core chaotic-dynamics assumption, measuring a positive Lyapunov exponent ( λ = 0.47 ± 0.17 across 10 independent trials) and a corresponding key-sensitivity effect in which near-identical initial conditions rapidly diverge into unrelated collision sequences. Third, we report a transparent performance evaluation showing 22–100 × execution-time overhead relative to static AES-256 encryption for small configurations (3–5 shards) with only 50% convergence reliability within a fixed step budget, and we trace this unreliability to a specific, structural failure mode of the collision-detection process rather than an unexplained anomaly. These results indicate that, in its current unoptimized form, DaChE is a viable additional security layer for high-security, low-frequency access scenarios (e.g., audit logs, defense or medical records) rather than a general-purpose database mechanism, and we identify concrete algorithmic, complexity-reduction, and formal-security directions required before broader deployment. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Information Security is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Βάση Δεδομένων: | Business Source Index |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://dx.doi.org/doi:10.1007/s10207-026-01304-3 Name: EDS - Springer Nature Journals (s7799221) Category: fullText Text: View record at Springer – Url: https://resolver.ebsco.com/c/fiv2js/result?sid=EBSCO:bsx&genre=article&issn=16155262&ISBN=&volume=25&issue=5&date=20261001&spage=1&pages=1-10&title=International Journal of Information Security&atitle=DaChE%3A%20a%20proof-of-concept%20for%20chaos-based%20database%20security%20with%20dynamic%20data%20motion.&aulast=Weinberg%2C%20Abraham%20Itzhak&id=DOI:10.1007/s10207-026-01304-3 Name: Full Text Finder (for New FTF UI) (ns324271) Category: fullText Text: Full Text Finder MouseOverText: Full Text Finder |
|---|---|
| Header | DbId: bsx DbLabel: Business Source Index An: 195896217 RelevancyScore: 1435 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1435 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: DaChE: a proof-of-concept for chaos-based database security with dynamic data motion. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Weinberg%2C+Abraham+Itzhak%22">Weinberg, Abraham Itzhak</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> aviw2010@gmail.com</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Information+Security%22">International Journal of Information Security</searchLink>. Oct2026, Vol. 25 Issue 5, p1-10. 10p. – Name: Subject Label: Subject Terms Group: Su Data: *<searchLink fieldCode="DE" term="%22Database+security%22">Database security</searchLink><br />*<searchLink fieldCode="DE" term="%22Data+encryption%22">Data encryption</searchLink><br />*<searchLink fieldCode="DE" term="%22Data+security%22">Data security</searchLink><br />*<searchLink fieldCode="DE" term="%22Distributed+computing%22">Distributed computing</searchLink><br />*<searchLink fieldCode="DE" term="%22Advanced+Encryption+Standard%22">Advanced Encryption Standard</searchLink><br /><searchLink fieldCode="DE" term="%22Benchmark+problems+%28Computer+science%29%22">Benchmark problems (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Lyapunov+exponents%22">Lyapunov exponents</searchLink><br /><searchLink fieldCode="DE" term="%22Collision+detection+%28Computer+animation%29%22">Collision detection (Computer animation)</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Database security remains fundamentally constrained by static defenses: fixed data locations and long-lived encryption keys give attackers a stationary target once perimeter defenses are breached. This paper makes three contributions toward an alternative, motion-based paradigm. First, we introduce the Database in Motion Chaos Encryption (DaChE) algorithm, in which AES-256-encrypted data shards are bound to balls that move through a Bunimovich stadium billiard, with decryption released only when a ball collides with a matching key-holding obstacle; a MapReduce-style pipeline aggregates the resulting partial query results. Second, we provide a proof-of-concept implementation and empirically validate the algorithm's core chaotic-dynamics assumption, measuring a positive Lyapunov exponent ( λ = 0.47 ± 0.17 across 10 independent trials) and a corresponding key-sensitivity effect in which near-identical initial conditions rapidly diverge into unrelated collision sequences. Third, we report a transparent performance evaluation showing 22–100 × execution-time overhead relative to static AES-256 encryption for small configurations (3–5 shards) with only 50% convergence reliability within a fixed step budget, and we trace this unreliability to a specific, structural failure mode of the collision-detection process rather than an unexplained anomaly. These results indicate that, in its current unoptimized form, DaChE is a viable additional security layer for high-security, low-frequency access scenarios (e.g., audit logs, defense or medical records) rather than a general-purpose database mechanism, and we identify concrete algorithmic, complexity-reduction, and formal-security directions required before broader deployment. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Information Security is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=195896217 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10207-026-01304-3 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 10 StartPage: 1 Subjects: – SubjectFull: Database security Type: general – SubjectFull: Data encryption Type: general – SubjectFull: Data security Type: general – SubjectFull: Distributed computing Type: general – SubjectFull: Advanced Encryption Standard Type: general – SubjectFull: Benchmark problems (Computer science) Type: general – SubjectFull: Lyapunov exponents Type: general – SubjectFull: Collision detection (Computer animation) Type: general Titles: – TitleFull: DaChE: a proof-of-concept for chaos-based database security with dynamic data motion. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Weinberg, Abraham Itzhak IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 16155262 Numbering: – Type: volume Value: 25 – Type: issue Value: 5 Titles: – TitleFull: International Journal of Information Security Type: main |
| ResultId | 1 |