The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Euler circuits and DNA sequencing by hybridization
Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
A high-level programming environment for packet trace anonymization and transformation
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A formal analysis of information disclosure in data exchange
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Structure preserving anonymization of router configuration data
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Payload attribution via hierarchical bloom filters
Proceedings of the 11th ACM conference on Computer and communications security
A Framework for High-Accuracy Privacy-Preserving Mining
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Privacy via pseudorandom sketches
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximate fingerprinting to accelerate pattern matching
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Autograph: toward automated, distributed worm signature detection
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
The boundary between privacy and utility in data publishing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Introduction to Information Retrieval
Introduction to Information Retrieval
Computing arbitrary functions of encrypted data
Communications of the ACM
Information Hiding: Steganography and Watermarking-Attacks and Countermeasures Steganography and Watermarking - Attacks and Countermeasures
| Hi-index | 0.00 |
Various research efforts would benefit from the ability to exchange and share information (traces with packet payloads, or other detailed system logs) to enable more data-driven research. Protection of the sensitive content is crucial for extensive information sharing. We present results of Kencl and Loebl (2009) [41] and Blamey et al. (in preparation) [4] about a technique of information concealing, based on introduction and maintenance of families of repeats. The structure of repeats in DNA constitutes an important obstacle for its reconstruction by hybridisation. A large proportion of eukaryotic genomes is composed of DNA segments that are repeated either precisely or in variant form more than once. As yet, no function has been associated with many of the repeats. In the paper by Blamey et al. (in preparation) [4], the authors propose that in eukaryotes the cells have DNA as a depositary of concealed genetic information and the genome achieves the self-concealing by accumulation and maintenance of repeats. The protected information may be shared and this is useful for the development of intercellular communication and in the development of multicellular organisms. The results presented here are protected by Czech patent number 301799 and by US Patent Application number 12/670.