Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Are you The One to Share? Secret Transfer with Access Structure

Are you The One to Share? Secret Transfer with Access Structure Abstract Sharing information to others is common nowadays, but the question is with whom to share. To address this problem, we propose the notion of secret transfer with access structure (STAS). STAS is a twoparty computation protocol that enables the server to transfer a secret to a client who satisfies the prescribed access structure. In this paper, we focus on threshold secret transfer (TST), which is STAS for threshold policy and can be made more expressive by using linear secret sharing. TST enables a number of applications including a simple construction of oblivious transfer (OT) with threshold access control, and (a variant of) threshold private set intersection (t-PSI), which are the first of their kinds in the literature to the best of our knowledge. The underlying primitive of STAS is a variant of OT, which we call OT for a sparse array. We provide two constructions which are inspired by state-of-the-art PSI techniques including oblivious polynomial evaluation (OPE) and garbled Bloom filter (GBF). The OPEbased construction is secure in the malicious model, while the GBF-based one is more efficient. We implemented the latter one and showed its performance in applications such as privacy-preserving matchmaking. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Proceedings on Privacy Enhancing Technologies de Gruyter

Are you The One to Share? Secret Transfer with Access Structure

Download PDF
21 pages

Loading next page...
 
/lp/de-gruyter/are-you-the-one-to-share-secret-transfer-with-access-structure-ZzaXWydyO0
Publisher
de Gruyter
Copyright
Copyright © 2017 by the
ISSN
2299-0984
eISSN
2299-0984
DOI
10.1515/popets-2017-0010
Publisher site
See Article on Publisher Site

Abstract

Abstract Sharing information to others is common nowadays, but the question is with whom to share. To address this problem, we propose the notion of secret transfer with access structure (STAS). STAS is a twoparty computation protocol that enables the server to transfer a secret to a client who satisfies the prescribed access structure. In this paper, we focus on threshold secret transfer (TST), which is STAS for threshold policy and can be made more expressive by using linear secret sharing. TST enables a number of applications including a simple construction of oblivious transfer (OT) with threshold access control, and (a variant of) threshold private set intersection (t-PSI), which are the first of their kinds in the literature to the best of our knowledge. The underlying primitive of STAS is a variant of OT, which we call OT for a sparse array. We provide two constructions which are inspired by state-of-the-art PSI techniques including oblivious polynomial evaluation (OPE) and garbled Bloom filter (GBF). The OPEbased construction is secure in the malicious model, while the GBF-based one is more efficient. We implemented the latter one and showed its performance in applications such as privacy-preserving matchmaking.

Journal

Proceedings on Privacy Enhancing Technologies – de Gruyter

Published: Jan 1, 2017

References

  • Goldwasser The knowledge complexity of interactive proof - systems In
    Micali
  • How to share a secret
    Shamir
  • sharing across private databases In
    Agrawal
  • How to share a secret
    Shamir
  • On the false - positive rate of Bloom filters Process
    Bose
  • Preventing real time map hacks in online games In on Privacy
    Bursztein
  • Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection In
    Jarecki
  • Private set intersection : Are garbled circuits better than custom protocols In
    Huang
  • Wen When private set intersection meets big data : an efficient and scalable protocol In
    Dong
  • Threshold password - authenticated key exchange
    MacKenzie
  • Practical private set intersection protocols with linear complexity In FC
    Cristofaro
  • Efficient fuzzy matching and intersection on private datasets In
    Ye
  • Efficient private matching and set intersection In
    Freedman
  • Efficient privacy preserving content based publish subscribe systems In
    Nabeel
  • Goldreich The Foundations of Cryptography Volume Basic Applications Cambridge University
    Press
  • Decentralizing attribute based encryption In
    Lewko
  • Practical threshold signatures In
    Shoup
  • Privacy preserving set operations In
    Kissner
  • time trade - offs in hash coding with allowable errors
    Bloom
  • Provably secure threshold password - authenticated key exchange
    Raimondo
  • Towards a cryptographic treatment of publish subscribe systems of
    Yuen
  • Secure Schemes for Secret Sharing and Key Distribution thesis
    Beimel
  • Honest - verifier private disjointness testing without random oracles In PET
    Hohenberger
  • Preventing real time map hacks in online games In on Privacy
    Bursztein
  • verifiable random function with short proofs and keys In
    Dodis
  • Expressive with partially hidden access structures In
    Lai
  • On the false - positive rate of Bloom filters Process
    Bose
  • Are you the one to share ? Secret transfer with access structure ePrint
    Zhao
  • Efficient set operations in the presence of malicious adversaries In
    Hazay
  • search and oblivious pseudorandom functions In
    Freedman
  • del Size - hiding in private set intersection : Existential results and constructions In
    Arco
  • if size matters Size hiding private set intersection In
    Ateniese
  • Goldreich The Foundations of Cryptography Volume Basic Applications Cambridge University
    Press
  • Efficient set operations in the presence of malicious adversaries In
    Hazay
  • Linear - complexity private set intersection protocols secure in malicious model In
    Cristofaro
  • delegated private set intersection on outsourced datasets In SEC
    Abadi
  • sharing across private databases In
    Agrawal
  • Efficient fuzzy matching and intersection on private datasets In
    Ye
  • del Size - hiding in private set intersection : Existential results and constructions In
    Arco
  • Oblivious polynomial evaluation and secure setintersection from algebraic PRFs In TCC Part - II
    Hazay
  • Decentralizing attribute based encryption In
    Lewko
  • Outsourced private set intersection using homomorphic encryption In
    Kerschbaum
  • Wen When private set intersection meets big data : an efficient and scalable protocol In
    Dong
  • Threshold cryptosystems In
    Desmedt
  • Public - key cryptosystems based on composite degree residuosity classes In
    Paillier
  • Faster private set intersection based on OT extension In
    Pinkas
  • Practical for electronic commerce In
    Henry
  • Finding bots with structured graph analysis In
    Nagaraja
  • Private set intersection : Are garbled circuits better than custom protocols In
    Huang
  • Attribute - based encryption with partially hidden encryptor - specified access structures In
    Nishide
  • Provably secure threshold password - authenticated key exchange
    Raimondo
  • Secure Schemes for Secret Sharing and Key Distribution thesis
    Beimel
  • Soled Efficient robust private set intersection In
    Dachman
  • Honest - verifier private disjointness testing without random oracles In PET
    Hohenberger
  • Linear - complexity private set intersection protocols secure in malicious model In
    Cristofaro
  • verifiable random function with short proofs and keys In
    Dodis
  • Towards a cryptographic treatment of publish subscribe systems of
    Yuen
  • Attribute - based encryption with partially hidden encryptor - specified access structures In
    Nishide
  • search and oblivious pseudorandom functions In
    Freedman
  • Phasing Private set intersection using permutation - based hashing In
    Pinkas
  • Oblivious polynomial evaluation and secure setintersection from algebraic PRFs In TCC Part - II
    Hazay
  • Threshold cryptosystems In
    Desmedt
  • Expressive with partially hidden access structures In
    Lai
  • Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection In
    Jarecki
  • Finding bots with structured graph analysis In
    Nagaraja
  • edge cryptography through the lens of secret sharing In TCC Part II
    Komargodski
  • Goldwasser The knowledge complexity of interactive proof - systems In
    Micali
  • Location privacy via private proximity testing In
    Narayanan
  • Sudan fuzzy vault scheme Des Codes
    Juels
  • Efficient privacy preserving content based publish subscribe systems In
    Nabeel
  • Practical private set intersection protocols with linear complexity In FC
    Cristofaro
  • Outsourced private set intersection using homomorphic encryption In
    Kerschbaum
  • time trade - offs in hash coding with allowable errors
    Bloom
  • Practical verifiable encryption and decryption of discrete logarithms In
    Camenisch
  • Faster private set intersection based on OT extension In
    Pinkas
  • edge cryptography through the lens of secret sharing In TCC Part II
    Komargodski
  • Public - key cryptosystems based on composite degree residuosity classes In
    Paillier
  • Phasing Private set intersection using permutation - based hashing In
    Pinkas
  • if size matters Size hiding private set intersection In
    Ateniese
  • Soled Efficient robust private set intersection In
    Dachman
  • Location privacy via private proximity testing In
    Narayanan
  • Sudan fuzzy vault scheme Des Codes
    Juels
  • Threshold password - authenticated key exchange
    MacKenzie
  • Practical threshold signatures In
    Shoup
  • Are you the one to share ? Secret transfer with access structure ePrint
    Zhao
  • Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries In
    Hazay
  • Efficient private matching and set intersection In
    Freedman
  • delegated private set intersection on outsourced datasets In SEC
    Abadi
  • Privacy preserving set operations In
    Kissner
  • Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries In
    Hazay
  • Practical verifiable encryption and decryption of discrete logarithms In
    Camenisch
  • Practical for electronic commerce In
    Henry