Filters








1,896 Hits in 2.7 sec

On Quantum Obfuscation [article]

Gorjan Alagic, Bill Fefferman
2016 arXiv   pre-print
: perfect, statistical, and computational.  ...  The obfuscator can also satisfy one of a number of obfuscation conditions: black-box, information-theoretic black-box, indistinguishability, and best possible; the last two conditions come in three variants  ...  It was widely believed that computational indistinguishability was too weak of a condition to provide any interesting applications.  ... 
arXiv:1602.01771v1 fatcat:rktvba7hsjdv5n56kcyr3vur3m

Constructions for Quantum Indistinguishability Obfuscation [article]

Anne Broadbent, Raza Ali Kazmi
2021 arXiv   pre-print
any two circuits of the same size that compute the same function, the outputs of the indistinguishability obfuscator are indistinguishable.  ...  An indistinguishability obfuscator is a probabilistic polynomial-time algorithm that takes a circuit as input and outputs a new circuit that has the same functionality as the input circuit, such that for  ...  Acknowledgements This material is based upon work supported by the Air Force Office of Scientific Research under award number FA9550-17-1-0083, Canada's NFRF and NSERC, an Ontario ERA, and the University  ... 
arXiv:2005.14699v2 fatcat:bx3h2l5hdbf37puwzlpubk34ni

Online Randomization Strategies to Obfuscate User Behavioral Patterns

Juan E. Tapiador, Julio C. Hernandez-Castro, Pedro Peris-Lopez
2012 Journal of Network and Systems Management  
In doing so, we introduce an indistinguishability-based definition for perfectly obfuscated actions and a concrete scheme to randomize user traces in an incremental way.  ...  When operating from the cloud, traces of user activities and behavioral patterns are accessible to anyone with enough privileges within the system.  ...  Acknowledgments We thank the anonymous reviewers for their insights and comments that have greatly contributed to improve the quality of this work.  ... 
doi:10.1007/s10922-012-9246-0 fatcat:djjk5jrd4vbezmt5e4gemfijxe

Symmetric-Key Based Proofs of Retrievability Supporting Public Verification [chapter]

Chaowen Guan, Kui Ren, Fangguo Zhang, Florian Kerschbaum, Jia Yu
2015 Lecture Notes in Computer Science  
In this work we explore indistinguishability obfuscation for building a Proof-of-Retrievability scheme that provides public verification while the encryption is based on symmetric key primitives.  ...  This could be useful in applications where outsourcing files is usually done by low-power client and verifications can be done by well equipped machines (e.g., a third party server).  ...  Acknowledgments This work is supported in part by US National Science Foundation under grant CNS-1262277 and the National Natural Science Foundation of China (Nos. 61379154 and U1135001).  ... 
doi:10.1007/978-3-319-24174-6_11 fatcat:mphmzs2khjaxhnj5u77mm3njl4

Differentially Private Location Privacy in Practice [article]

Vincent Primault, Sonia Ben Mokhtar, Cedric Lauradoux, Lionel Brunie
2014 arXiv   pre-print
This precision depends on the degree of obfuscation applied by Geo-Indistinguishability.  ...  Finally, we show in our study that POIs constitute a quasi-identifier for mobile users and that obfuscating them using Geo-Indistinguishability is not sufficient as an attacker is able to re-identify at  ...  Figure 1 . 1 Example of a mobility trace and its obfuscated version. Figure 2 . 2 Remapping obfuscated POIs to real ones.  ... 
arXiv:1410.7744v1 fatcat:r6xomghjhndwvos65ccxytoq54

Strong Hardness of Privacy from Weak Traitor Tracing [article]

Lucas Kowalczyk, Tal Malkin, Jonathan Ullman, Mark Zhandry
2016 arXiv   pre-print
Our proofs build on the connection between hardness results in differential privacy and traitor-tracing schemes (Dwork et al., STOC'09; Ullman, STOC'13).  ...  Despite much study, the computational complexity of differential privacy remains poorly understood.  ...  Indistinguishability obfuscation guarantees that P 2 and P 3 are computationally indistinguishable.  ... 
arXiv:1607.06141v1 fatcat:ayrk55icnnhvljgdtbx2akismq

Strong Hardness of Privacy from Weak Traitor Tracing [chapter]

Lucas Kowalczyk, Tal Malkin, Jonathan Ullman, Mark Zhandry
2016 Lecture Notes in Computer Science  
Specifically, we prove that if one-way functions and indistinguishability obfuscation exist, then:  ...  Despite much study, the computational complexity of differential privacy remains poorly understood.  ...  The first and second authors are supported in part by the Defense Advanced Research Project Agency (DARPA) and Army Research Office (ARO) under Contract #W911NF-15-C-0236, and NSF grants #CNS-1445424 and  ... 
doi:10.1007/978-3-662-53641-4_25 fatcat:dzmt3xjc4bca5iy7gylpc5znn4

Obfuscation of sensitive data in network flows

Daniele Riboni, Antonio Villani, Domenico Vitali, Claudio Bettini, Luigi V. Mancini
2012 2012 Proceedings IEEE INFOCOM  
On the other hand, microdata anonymization techniques are not directly applicable to network flows.  ...  Experimental results show that our obfuscation technique preserves the utility of network flows for network traffic analysis.  ...  Finally, we return the set L * α of obfuscated flows (line 31). D. Correctness and computational complexity Theorem 5: Algorithm 1 correctly computes a (k, j)obfuscation function.  ... 
doi:10.1109/infcom.2012.6195626 dblp:conf/infocom/RiboniVVBM12 fatcat:po354dvtxrb4zjloijmpihs2mi

Obfuscating Re-encryption Algorithm With Flexible and Controllable Multi-Hop on Untrusted Outsourcing Server

Mingwu Zhang, Yan Jiang, Yi Mu, Willy Susilo
2017 IEEE Access  
various applications.  ...  various applications.  ...  According to the property of functionality preservation, the obfuscation output obf is computationally indistinguishable from the output of re-encryption ReEnc(ct i , rk i→j ).  ... 
doi:10.1109/access.2017.2771335 fatcat:i2berlgkmvfjlf4nuzujyec2ji

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation [chapter]

Dan Boneh, Mark Zhandry
2014 Lecture Notes in Computer Science  
Indistinguishability obfuscation asks that obfuscations of any two (equal-size) programs that compute the same function are computationally indistinguishable.  ...  In this work, we show how to use indistinguishability obfuscation (iO) to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing.  ...  Opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of DARPA or IARPA.  ... 
doi:10.1007/978-3-662-44371-2_27 fatcat:3cz3xxubczc53kvim4j3e5mffy

Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation

Dan Boneh, Mark Zhandry
2016 Algorithmica  
Indistinguishability obfuscation asks that obfuscations of any two (equal-size) programs that compute the same function are computationally indistinguishable.  ...  In this work, we show how to use indistinguishability obfuscation (iO) to build multiparty key exchange, efficient broadcast encryption, and efficient traitor tracing.  ...  Opinions, findings and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of DARPA or IARPA.  ... 
doi:10.1007/s00453-016-0242-8 fatcat:rkwrtoma7nbehl4b23wztuq3vu

One-Way Functions and (Im)Perfect Obfuscation

Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014 2014 IEEE 55th Annual Symposium on Foundations of Computer Science  
A program obfuscator takes a program and outputs a "scrambled" version of it, where the goal is that the obfuscated program will not reveal much about its structure beyond what is apparent from executing  ...  (CRYPTO 2001), the requirement is that the results of obfuscating any two functionally equivalent programs (circuits) will be computationally indistinguishable.  ...  We thank Nir Bitansky, Zvika Brakerski and Ron Rothblum for many helpful discussions.  ... 
doi:10.1109/focs.2014.47 dblp:conf/focs/KomargodskiMNPRY14 fatcat:rwk52styv5foddpph3cq3fzfhi

Is Geo-Indistinguishability What You Are Looking for? [article]

Simon Oya, Carmela Troncoso, Fernando Pérez-González
2017 arXiv   pre-print
In this paper, we provide an alternative formulation of geo-indistinguishability as an adversary error, and use it to show that the privacy vs.  ...  of average error, and enabling the possibility of exposing obfuscated locations that are useless from the quality of service point of view.  ...  ACKNOWLEDGMENTS This work is partially supported by EU H2020-ICT-10-2015 NEXTLEAP (GA n 688722), the Agencia Estatal de Investigación (Spain) and the European Regional Development  ... 
arXiv:1709.06318v1 fatcat:tb6gddzay5gcpjzo2nqrjyyu4m

Constrained Pseudorandom Functions for Unconstrained Inputs [chapter]

Apoorvaa Deshpande, Venkata Koppula, Brent Waters
2016 Lecture Notes in Computer Science  
An obfuscator O is an indistinguishability obfuscator for circuits if for any two circuits C 1 and C 2 that have identical functionality, their obfuscations O(C 1 ) and O(C 2 ) are computationally indistinguishable  ...  The program Prog-PK takes as input a string acc-inp, computes r = F (k, acc-inp) and uses r as randomness for PKE.setup. It finally outputs the PKE public key.  ...  We would like to thank the anonymous reviewers for their valuable feedback and comments.  ... 
doi:10.1007/978-3-662-49896-5_5 fatcat:jbyxvzmxsbecjibfyhildkrnqu

Bootstrappable Identity-Based Fully Homomorphic Encryption [chapter]

Michael Clear, Ciarán McGoldrick
2014 Lecture Notes in Computer Science  
In this work, we present a "pure" IBFHE scheme from indistinguishability obfuscation, and extend the result to the attribute-based setting.  ...  Contributions Construction of "Pure" IBFHE We construct the first "pure" IBFHE scheme using the technique of "punctured programming" [17], a powerful tool combining an indistinguishability obfuscator [  ...  Observe that the modified function is identical to F MapPK , and due to the security of indistinguishability obfuscation, their respective obfuscations are thus computationally indistinguishable.  ... 
doi:10.1007/978-3-319-12280-9_1 fatcat:sajo7ysvovgvnm5r33hvstwewe
« Previous Showing results 1 — 15 out of 1,896 results