article

Free access

Comparing information without leaking it

Authors:

Ronald Fagin,

Moni Naor,

Peter WinklerAuthors Info & Claims

Communications of the ACM, Volume 39, Issue 5

Pages 77 - 85

https://doi.org/10.1145/229459.229469

Published: 01 May 1996 Publication History

PDF eReader

References

[1]

Barrin iton D A Bounded@idth o lynomial-sized branch in programs recognize exactly those language s in NC i*; J Computer#}t. Sci. 38 (}988), 150-i64.

Digital Library

Google Scholar

[2]

BemOri Mi Goldreichi Oi Micalii Sii and vesti Ri A fair prot~ col for contract signing, Trans. In./'. The~ 36 (I990), 40-46.

Digital Library

Google Scholar

[3]

BenOr; M Goldwasse r! S i; and Wigd e rson ! Completeness theorems for noncryptographic fault tolerated distributed computation; In Proceedings of 20th ACM Symposium on TheoU of Computing (Chicagoi I988)i PPi I10;

Digital Library

Google Scholar

[4]

Brassard Gi Gr6 peau i C i i and Ro b e rtiJ i;Mi M bo r-N ot h ing D is; closure of Secrets, Advances in G~ptoio~, erypto '86, Lecture Notes in Computer Science; Vol; 263; S pringer-Verlagi New York{ I98 pp: 234-238i

Digital Library

Google Scholar

[5]

Carteri JiLi and Wegman; M;N; Universal classes of hash func tions Com#ut: Syst: Sci: 18 (1979)143154!

Google Scholar

[6]

Chaum Di; Crdpeau Cii and Damg~rd I; Multiparty uncondi ionaI s e cure p roto coIs; In Proceedings of the 20th ACM Symposium on Theov gComputing (Chicagoi1988){ pp{1119{

Digital Library

Google Scholar

[7]

Ch o r; B:; and Ku s h ilevitz; E i A ze to-one law for Boolean p rivacy mM~ Discr. Math. 4 (1991)i 3647i

Digital Library

Google Scholar

[8]

Clevei Ri Controlled Gradual Disclosure Schemes for ~ndom Bits and Thei~A licationsAdvances in CU t olo C to i 89Lecture Notes in Computer Sciencei Vol; 435; Springer-Verlag; New York1987;ppi 573 587i

Digital Library

Google Scholar

[9]

Cr~peau, Cii and ~lian, J; Discreet SolitaU Games, Advances in C~ptolo~, Cupto '93, 5ecture Notes ih Computer Science, Voli773: Springer-Verlagi New York 1994:pp3 I9-330i

Digital Library

Google Scholar

[10]

Eveni Gol dreichi and gempeli Ai Arandomized p roto co 1 for signi n g co n tracts: Commun: A CM 28 (1985) i 637G647:

Digital Library

Google Scholar

[11]

Veige, ~:, K{{ian, J., and Naor, M. On minimal models for secure computationi In Proceedings of the 26th ACM Symposium on Theou ofComputi~ (Montrdali 1994)i pp; 554 563i

Digital Library

Google Scholar

[12]

Goldreichi Oi Randomnessi interactive proofsi and zero ~owl edge su~eyi In TheUniversalTunngMachineiAHa~Centu~ Su~evi Ri Herken; edi; Oxford UniversiW Pressi I988; ppi 377-405;

Digital Library

Google Scholar

[13]

Goldreichi Oi; ~ical'ii Mii and Wigderson, ~. Ho~ to play any mentaI dam e. In Proceedinv of the i9th ACM #mpos of Computing (NewYorki 1987)i pp; 218229

Digital Library

Google Scholar

[14]

Kilian ;J i Use of Randomness in Algorithms and Protocolsi M IT Pre ssi Cambridge Mass;; 1990;

Digital Library

Google Scholar

[15]

Rabini M:O: How to exchange secrets by oblivious transferi Tech. ~emo TR-8I; Nken Computation Laboratou; Hazard Univers i~: I98 I2

Google Scholar

[16]

Rabini M;O; Transaction protection by beaconsi J; Computer sy,t; s~; 27 (i0ss);

Google Scholar

[17]

Sham it; A{i mvesti R!; and Adle man; C i Mental poker i In The Mathematical Gardener, D i Fdar ne r; ed! Wadsworth Internation ali 1981i PPi 3743i

Google Scholar

[18]

Wegmani MiN{; and Carteri J{L; New hash functions and their use in authentication and set equali~i J2 Computi Syst2 Scii 22 22(1981) 265-279i

Google Scholar

[19]

Wiesner, S. Conjugate coding. SIGACTVws15 (1983), 78-88.

Digital Library

Google Scholar

[20]

Y ao; A: C: Protocols fo r seeure computations; In Proceedings of the S~mposium on Foundations g Computer Science ~Chica go; I982); 160-I64i

Digital Library

Google Scholar

[21]

Yaoi AiCi How to generate and exchange secretsi In Proceedings of the 27th Symposium on Foundations of Computer Science (Toronto, I98 I62-I67!

Digital Library

Google Scholar

Cited By

View all

Lu YDing G(2024)Quantum Secure Multi-Party Summation with Graph StateEntropy10.3390/e2601008026:1(80)Online publication date: 17-Jan-2024
https://doi.org/10.3390/e26010080
Meng SDang CLiang BDing J(2024)Two-Round Post-quantum Private Equality Test and OT from RLWE-EncryptionInformation and Communications Security10.1007/978-981-97-8801-9_2(24-42)Online publication date: 25-Dec-2024
https://doi.org/10.1007/978-981-97-8801-9_2
Liu XTu XLuo DXu GXiong NChen X(2023)Secure Multi-Party Computation of Graphs’ Intersection and Union under the Malicious ModelElectronics10.3390/electronics1202025812:2(258)Online publication date: 4-Jan-2023
https://doi.org/10.3390/electronics12020258
Show More Cited By

Index Terms

Comparing information without leaking it
1. Information systems
  1. Information storage systems
    1. Storage architectures
      1. Storage network architectures

Recommendations

Correcting errors without leaking partial information
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak a significant amount of information about W --- that is, from the ...
Cloud-Based RFID mutual authentication protocol without leaking location privacy to the cloud

With the rapid developments of the IoT (Internet of Things) and the cloud computing, cloud-based RFID systems attract more attention. Users can reduce their cost of deploying and maintaining the RFID system by purchasing cloud services. However, the ...
RFID security without extensive cryptography
SASN '05: Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks

A Radio Frequency Identification Device (RFID) allows effective identification of a large number of tagged objects without physical or visual contact. RFID systems are a promising technology for supply chain management and inventory control. As ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 39, Issue 5

May 1996

101 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/229459

Editor:
Jacques Cohen
Brandeis Univ., Waltham, MA

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1996

Published in CACM Volume 39, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

159
Total Citations
View Citations
1,760
Total Downloads

Downloads (Last 12 months)601
Downloads (Last 6 weeks)38

Reflects downloads up to 26 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lu YDing G(2024)Quantum Secure Multi-Party Summation with Graph StateEntropy10.3390/e2601008026:1(80)Online publication date: 17-Jan-2024
https://doi.org/10.3390/e26010080
Meng SDang CLiang BDing J(2024)Two-Round Post-quantum Private Equality Test and OT from RLWE-EncryptionInformation and Communications Security10.1007/978-981-97-8801-9_2(24-42)Online publication date: 25-Dec-2024
https://doi.org/10.1007/978-981-97-8801-9_2
Liu XTu XLuo DXu GXiong NChen X(2023)Secure Multi-Party Computation of Graphs’ Intersection and Union under the Malicious ModelElectronics10.3390/electronics1202025812:2(258)Online publication date: 4-Jan-2023
https://doi.org/10.3390/electronics12020258
Xu ZWu LQin CLi SZhang SLu R(2023)PriTAEC: Privacy-Preserving Task Assignment Based on Oblivious Transfer and Edge Computing in VANETIEEE Transactions on Vehicular Technology10.1109/TVT.2022.322304572:4(4996-5009)Online publication date: Apr-2023
https://doi.org/10.1109/TVT.2022.3223045
Duong TGao JPhan DTrieu N(2023)Privacy-Preserving Digital Vaccine PassportCryptology and Network Security10.1007/978-981-99-7563-1_7(137-161)Online publication date: 30-Oct-2023
https://dl.acm.org/doi/10.1007/978-981-99-7563-1_7
Lu SLv CWang WXu CFan HLu YHu YLi W(2022)Secret Numerical Interval Decision Protocol for Protecting Private Information and Its Application2022 Asia Conference on Algorithms, Computing and Machine Learning (CACML)10.1109/CACML55074.2022.00126(726-731)Online publication date: Mar-2022
https://doi.org/10.1109/CACML55074.2022.00126
Javani FSherman A(2022)BVOT: self-tallying boardroom voting with oblivious transferInformation Security Journal: A Global Perspective10.1080/19393555.2022.213879833:1(42-53)Online publication date: 2-Nov-2022
https://doi.org/10.1080/19393555.2022.2138798
Sang YShen HTan YXiong N(2022)Efficient Protocols for Privacy Preserving Matching Against Distributed DatasetsInformation and Communications Security10.1007/11935308_15(210-227)Online publication date: 10-Mar-2022
https://dl.acm.org/doi/10.1007/11935308_15
Saldamli GChow RJin H(2021)ILSSPP: Intelligent location sharing system with privacy preserving features for smart citiesJournal of Intelligent & Fuzzy Systems10.3233/JIFS-219102(1-12)Online publication date: 31-May-2021
https://doi.org/10.3233/JIFS-219102
Lu SLu YSun Y(2021)Collaborative calculation and application of interreal and real interval relations to protect privacyPLOS ONE10.1371/journal.pone.026121316:12(e0261213)Online publication date: 14-Dec-2021
https://doi.org/10.1371/journal.pone.0261213
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Correcting errors without leaking partial information

Cloud-Based RFID mutual authentication protocol without leaking location privacy to the cloud

RFID security without extensive cryptography

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations