Abstract
We consider the possibility of secure communications over an insecure channel when the two agents have no verifiable public keys, no shared cryptographic information, and no trusted third party to assist them.
We investigate two scenarios. In the first, the agents are biologically related, and use biological data to construct a shared key; the possibility of using DNA data, shared between the two parties but not readily available to others, is considered. The second concerns unrelated parties who have some printed material, such as a photograph, in common; we explore the possibility of scanning this material at both ends and constructing a secret key from the shared information.
In each case, the two parties can convert their information into approximately equal sequences of bits. We borrow results from coding theory to show how these approximate sequences can be turned into exactly equal shared keys without compromising security in the process.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Atallah, Mikhail J., Kerschbaum, Florian, and Du, Wenliang (2003). Secure and Private Sequence Comparisons. In Proceedings of the ACM workshop on Privacy in the electronic society, pages 39–44. ACM Press.
Biondo, R. (2000). The impact of CODIS software in criminal investigations in the Italian police. In Eleventh International Symposium on Human Identification. Available from www.promega.com/geneticidproc/ussympllproc/content/biondo.pdf.
Butler, J. M., Schoske, R., Vallone, P. M., Kline, M. C, Redd, A. J., and Hammer, M. F. (2002). A novel multiplex for simultaneous amplification of 20 Y chromosome STR markers. Forensic Science International, 129:10–24.
Calabi, L. and Hartnett, W. E. (1969). A family of codes for the correction of substitution and synchronization errors. IEEE Transactions on Information Theory, IT-15:102–106.
Csiszár, I. and Körner, J. (1978). Broadcast channels with confidential messages. IEEE Transactions on Information Theory, 24(3):339–348.
Garcia, A. and Stichtenoth, H. (1995). A tower of Aritin-Schreier extensions of function fields attaining the Drinfed-Vladut bound. Inventiones Mathematicae, 121(1):211–222.
Gill, P., Ivanov, P. L., Kimpton, C., Piercy, R., Benson, N., Tully, G., Evett, L., Hagelberg, E., and Sullivan, K. (1994). Identification of the remains of the Romanov family by DNA analysis. Nature Genetics, 6:130–135.
Handt, O., Meyer, S., and von Haeseler, A. (1998). Compilation of human mtDNA control region sequences. Nucleic Acids Research, 26(1):126–129.
Isenberg, A. R. and Moore, J. M. (1999). Mitochondrial DNA Analysis at the FBI Laboratory. Forensic Science Communications, 1(2). Available from http://www.fbi.gov/hq/lab/fsc/backissu/julyl999/dnatext.htm.
Levenshtein, V. I. (1966). Binary Codes Capable of Correcting Deletions, Insertions, and Reversals. Soviet Physics—Dolkady, 10(8):707–710.
Levenshtein, V. I. (1992). On perfect codes in deletion and insertion metric. Discrete Mathematics and its Applications, 2(3):241–258.
Massie, R. K. (1995). The Romanovs: The Final Chapter. Random House, New York.
Maurer, Ueli and Wolf, Stefan (1997). Privacy amplification secure against active adversaries. In Jr., Burton S. Kaliski, editor, Advances in Cryptology—CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 307–321. Springer-Verlag.
Maurer, Ueli and Wolf, Stefan (2000). Information-theoretic key agreement: From weak to strong secrecy for free. In Advances in Cryptology—EUROCRYPT 2000, volume 1807 of Lecture Notes in Computer Science, pages 351–368. Springer-Verlag.
Okuda, T., Tanaka, E., and Kasai, T. (1976). A method for the correction of garbled words based on the Levenshtein metric. IEEE Transactions on Computing, C-25(2): 172–176.
Parsons, T. J., Muniec, D. S., Sullivan, K., Woodyatt, N., Alliston-Greiner, R., Wilson, M. R., Berry, D. L., Holland, K. A., Weedn, V. W., Gill, P., and Holland, M. M. (1997). A high observed substitution rate in the human mitochondrial dna control region. Nature Genetics, 15:363–368.
Schulman, Leonard J. and Zuckerman, David (1997). Asymptotically Good Codes Correcting Insertions, Deletions, and Transpositions. In Symposium on Discrete Algorithms, pages 669–674.
Shannon, Claude (1949). Communication Theory of Secrecy Systems. Technical report, Bell Systems.
Spielman, Daniel A. (1995). Linear-time encodable and decodable error-correcting codes, pages 388–397.
Tully, G., Morley, J. M., and Bark, J. E. (1998). Forensic analysis of mitochondrial DNA: application of multiplex solid-phase-fluorescent minisequencing to high throughput analysis. In Second European Symposium on Human Identification, pages 92–96. Online at http://www.promega.com/geneticidproc/eusymp2proc/2 0.pdf.
Varshamov, R. R. and Tenengolts, G. M. (1965). Codes which correct single asymmetric errors. Automatika i Telemekhanika, 26(2):288–292.
Welsh, Dominic (1988). Codes and Cryptography. Oxford University Press.
Wyner, A. D. (1975). The wire-tap channel. Bell System Technical Journal, 54(8):1355–1387.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this paper
Cite this paper
Heather, J., Clark, J.Y. (2005). Family Secrets. In: Dimitrakos, T., Martinelli, F. (eds) Formal Aspects in Security and Trust. IFIP WCC TC1 2004. IFIP International Federation for Information Processing, vol 173. Springer, Boston, MA. https://doi.org/10.1007/0-387-24098-5_8
Download citation
DOI: https://doi.org/10.1007/0-387-24098-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-24050-3
Online ISBN: 978-0-387-24098-5
eBook Packages: Computer ScienceComputer Science (R0)