Hashing on strings, cryptography, and protection of privacy

Michael O. Rabin; S. Micali

Hashing on strings, cryptography, and protection of privacy

Michael O. Rabin^*
, S. Micali

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

3 Scopus citations

Abstract

The issues of privacy and reliability of personal data are of paramount importance. If L is a list of people carrying some harmful defective gene, questions as to whether a person is in L should be answered without compromising the data concerning anybody else. Reliability means that once the list is formed, nobody can play with the answer. Thus, the answer should be checkable by the agent posing the question. An efficient protocol for this task is presented, and the solution has a very strong protection properties.

Original language	English
Pages	1
Number of pages	1
State	Published - 1997
Externally published	Yes
Event	Proceedings of the 1997 International Conference on Compression and Complexity of Sequences - Positano, Italy Duration: 11 Jun 1997 → 13 Jun 1997

Conference

Conference	Proceedings of the 1997 International Conference on Compression and Complexity of Sequences
City	Positano, Italy
Period	11/06/97 → 13/06/97

Cite this

@conference{dc67680711a045a590037ac8d7f736cf,

title = "Hashing on strings, cryptography, and protection of privacy",

abstract = "The issues of privacy and reliability of personal data are of paramount importance. If L is a list of people carrying some harmful defective gene, questions as to whether a person is in L should be answered without compromising the data concerning anybody else. Reliability means that once the list is formed, nobody can play with the answer. Thus, the answer should be checkable by the agent posing the question. An efficient protocol for this task is presented, and the solution has a very strong protection properties.",

author = "Rabin, \{Michael O.\} and S. Micali",

year = "1997",

language = "אנגלית",

pages = "1",

note = "Proceedings of the 1997 International Conference on Compression and Complexity of Sequences ; Conference date: 11-06-1997 Through 13-06-1997",

}

TY - CONF

T1 - Hashing on strings, cryptography, and protection of privacy

AU - Rabin, Michael O.

AU - Micali, S.

PY - 1997

Y1 - 1997

N2 - The issues of privacy and reliability of personal data are of paramount importance. If L is a list of people carrying some harmful defective gene, questions as to whether a person is in L should be answered without compromising the data concerning anybody else. Reliability means that once the list is formed, nobody can play with the answer. Thus, the answer should be checkable by the agent posing the question. An efficient protocol for this task is presented, and the solution has a very strong protection properties.

AB - The issues of privacy and reliability of personal data are of paramount importance. If L is a list of people carrying some harmful defective gene, questions as to whether a person is in L should be answered without compromising the data concerning anybody else. Reliability means that once the list is formed, nobody can play with the answer. Thus, the answer should be checkable by the agent posing the question. An efficient protocol for this task is presented, and the solution has a very strong protection properties.

UR - https://www.scopus.com/pages/publications/0031347575

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0031347575

SP - 1

T2 - Proceedings of the 1997 International Conference on Compression and Complexity of Sequences

Y2 - 11 June 1997 through 13 June 1997

ER -

Hashing on strings, cryptography, and protection of privacy

Abstract

Conference

Other files and links

Fingerprint

Cite this