On the public citation graph

Cryptanalysis of adaptive arithmetic coding encryption schemes

0 signed · 18 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4615-4046-5openalex-snapshot
Adaptive Data Compression
inferredcites →https://doi.org/10.1016/0167-4048(88)90580-9openalex-snapshot
On the privacy afforded by adaptive text compression
inferredcites →https://doi.org/10.1016/0167-4048(92)90011-fopenalex-snapshot
Data security in a fixed-model arithmetic coding compression algorithm
inferredcites →https://doi.org/10.1016/0167-4048(93)90099-qopenalex-snapshot
A chosen plaintext attack on an adaptive arithmetic coding compression algorithm
inferredcites →https://doi.org/10.1145/63030.63036openalex-snapshot
Application of splay trees to data compression

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-0-387-35568-9_19openalex-snapshot
Attack on Liu/Farrell/Boyd Arithmetic Coding Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-24806-1_30openalex-snapshot
On the Performance of Secret Entropy Coding: A Perspective Beyond Security
inferred← citeshttps://doi.org/10.1007/978-3-642-34704-7_24openalex-snapshot
Cryptanalysis of Randomized Arithmetic Codes Based on Markov Model
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_11openalex-snapshot
Efficient Implementation of Bilinear Pairings on ARM Processors
inferred← citeshttps://doi.org/10.1007/s11042-015-2468-xopenalex-snapshot
On the security of binary arithmetic coding based on interval shrinking
inferred← citeshttps://doi.org/10.1016/b978-012369476-8/50006-3openalex-snapshot
Multimedia Encryption
inferred← citeshttps://doi.org/10.1016/b978-012369476-8/50011-7openalex-snapshot
Format-Compliant Content Protection
inferred← citeshttps://doi.org/10.1016/j.cose.2011.11.005openalex-snapshot
On scrambling the Burrows–Wheeler transform to provide privacy in lossless compression
inferred← citeshttps://doi.org/10.1109/ccp.2011.28openalex-snapshot
A Method to Ensure the Confidentiality of the Compressed Data
inferred← citeshttps://doi.org/10.1109/cewit.2011.6135889openalex-snapshot
Cryptanalysis of secure arithmetic coding based on interval swapping
inferred← citeshttps://doi.org/10.1109/tmm.2005.854469openalex-snapshot
Design of integrated multimedia compression and encryption systems
inferred← citeshttps://doi.org/10.1117/12.435392openalex-snapshot
Efficient multimedia encryption via entropy codec design
inferred← citeshttps://doi.org/10.1155/2007/35262openalex-snapshot
Multimedia Encryption with Joint Randomized Entropy Coding and Rotation in Partitioned Bitstream
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.