948 Hits in 6.4 sec

A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation [chapter]

Matthew D. Green, Jonathan Katz, Alex J. Malozemoff, Hong-Sheng Zhou
2016 Lecture Notes in Computer Science  
Our techniques can easily be adapted to other idealized models, and thus we present a unified approach to showing separations for most protocols of interest in most idealized models.  ...  In this work we refute this possibility, assuming the existence of indistinguishability obfuscation. We do so in the following way.  ...  Acknowledgments The authors would like to thank Brent Waters and Susan Hohenberger for helpful conversations during the course of this work. Matthew  ... 
doi:10.1007/978-3-319-44618-9_31 fatcat:4hh3ho73hnfb7gyjmc4fbgjye4

Capturing the Essence of Practical Obfuscation [chapter]

J. Todd McDonald
2012 Communications in Computer and Information Science  
As a field of study, obfuscation would benefit from a unifying framework that has solid theoretical foundation yet provides value in empirical study and implementation.  ...  The essence of obfuscation (in practice) is best described as a measurable loss of abstraction.  ...  Other theoretic models relate security to the distributions produced by the obfuscator itself [3, 4] .  ... 
doi:10.1007/978-3-642-29166-1_44 fatcat:rqezlqbfynfi7dyidzormarol4

Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data [chapter]

Shashank Agrawal, Shweta Agrawal, Manoj Prabhakaran
2015 Lecture Notes in Computer Science  
of obfuscation -similar to how the Universal Composition framework unifies various multi-party computation tasks like commitment, coin-tossing and zero-knowledge proofs.  ...  Highlights of our framework include the following: • We use a new indistinguishability preserving (IND-PRE) definition of security that interpolates indistinguishability and simulation style definitions  ...  Standard indistinguishability based definitional approaches (which typically specify an explicit test that is ideal-hiding) run into the problem that if 13 Note that there is no parameter to a P auth  ... 
doi:10.1007/978-3-662-46803-6_17 fatcat:jzsadxqa2feznkhgfaj3kyo6ny

On Virtual Grey Box Obfuscation for General Circuits

Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth
2016 Algorithmica  
As a first step towards understanding the security of the [GGH + 13b] obfuscator, [BR13, BGK + 13] consider an ideal algebraic model, where the adversary is given "generic graded encodings" that can only  ...  A weaker notion yet, called indistinguishability obfuscation (IO) [BGI + 01], allows the (now computationally unbounded) simulator to also make an unbounded number of queries to C.  ...  Acknowledgements We are grateful to Rafael Pass for enlightening discussions and valuable comments.  ... 
doi:10.1007/s00453-016-0218-8 fatcat:ytmngd6szjec7d4jkk5cdix36a

Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation [chapter]

Afonso Arriaga, Manuel Barbosa, Pooya Farshim
2016 Lecture Notes in Computer Science  
We also develop a composable and distributionally secure inner-product obfuscator and use it to build an inner-product encryption scheme that achieves an unprecedented level of privacy.  ...  Obfuscation is a common building block that these constructions share, albeit the obfuscators necessary for each construction are based on different assumptions.  ...  A. Arriaga is supported by the National Research Fund, Luxembourg (AFR Grant No. 5107187).  ... 
doi:10.1007/978-3-319-49890-4_13 fatcat:wgiopvhqr5delfi4zo7g2qgi4q

Layered obfuscation: a taxonomy of software obfuscation techniques for layered security

Hui Xu, Yangfan Zhou, Jiang Ming, Michael Lyu
2020 Cybersecurity  
Inspired by the classic idea of layered security for risk management, we propose layered obfuscation as a promising way to realize reliable software obfuscation.  ...  Layered obfuscation, on the other hand, aims to mitigate the risks of reverse software engineering by integrating different obfuscation techniques as a whole solution.  ...  that graded encoding is a promising obfuscation algorithm for achieving a weaker security notion: indistinguishability.  ... 
doi:10.1186/s42400-020-00049-3 fatcat:jrymozivkvbkbd3aeg3redj4ne

Using Indistinguishability Obfuscation via UCEs [chapter]

Christina Brzuska, Arno Mittelbach
2014 Lecture Notes in Computer Science  
We provide the first standard model construction for a powerful class of Universal Computational Extractors (UCEs; Bellare et al. Crypto 2013) based on indistinguishability obfuscation.  ...  Indeed, recent negative results by Wichs (ITCS 2013) rule out a large class of techniques to prove the security of correlation-secure hash functions in the standard model.  ...  So far UCEs have only been constructed in idealized models.  ... 
doi:10.1007/978-3-662-45608-8_7 fatcat:6mvjrtuypff3xanz27v2qcxirq

Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation [chapter]

Yu Chen, Yuyu Wang, Hong-Sheng Zhou
2018 Advances in Industrial Control  
In this work, we develop a framework for building leakage-resilient cryptosystems in the bounded leakage model from puncturable primitives and indistinguishability obfuscation (iO).  ...  Prior works overcome this paradox by taking the following two approaches. One approach is directly resorting to leakage-resilient assumptions (which might be well packed as advanced assumptions).  ...  a non-black-box manner via obfuscation.  ... 
doi:10.1007/978-3-030-03329-3_20 fatcat:smqhwdi2pvgkrmskqdon6zrjmi

Zero Knowledge in the Random Oracle Model, Revisited [chapter]

Hoeteck Wee
2009 Lecture Notes in Computer Science  
-We establish a subtle separation between the Bellare-Rogaway formulation and a weaker formulation, which yields a finer distinction than the separation in Nielsen's work.  ...  -Extending our work on zero knowledge, we present a hierarchy for circuit obfuscation in the random oracle model, the weakest being that achieved in the work of Lynn, Prabhakaran and Sahai (Eurocrypt '  ...  I am very grateful towards Rafael Pass for insightful exchanges on the subject and for allowing me to include his observations on deniable zeroknowledge [23] , and the anonymous referees for meticulous  ... 
doi:10.1007/978-3-642-10366-7_25 fatcat:3x6cg3hbungublb43mka3mse3m

Relative privacy threats and learning from anonymized data

Michele Boreale, Fabio Corradi, Cecilia Viscardi
2019 IEEE Transactions on Information Forensics and Security  
Accordingly, we propose a unified Bayesian model of 9 group-based schemes and a related MCMC methodology to learn 10 the population parameters from an anonymized table.  ...  We consider group-based anonymization schemes, 1 a popular approach to data publishing.  ...  We propose a unified probabilistic model to reason about such forms of leakage.  ... 
doi:10.1109/tifs.2019.2937640 fatcat:oketvtntrvde7hfj2lroufoyma

A Survey on Split Manufacturing: Attacks, Defenses, and Challenges

Tiago D. Perez, Samuel Pagliarini
2020 IEEE Access  
, and layout obfuscation.  ...  In today's integrated circuit (IC) ecosystem, owning a foundry is not economically viable, and therefore most IC design houses are now working under a fabless business model.  ...  Mitigating attacks towards regular structures could be done by obfuscating those structures in such a way that they become indistinguishable.  ... 
doi:10.1109/access.2020.3029339 fatcat:g6kpdburfvesbazpjag25vnbim

A Survey on Split Manufacturing: Attacks, Defenses, and Challenges [article]

Tiago D. Perez, Samuel Pagliarini
2020 arXiv   pre-print
, and layout obfuscation.  ...  In today's integrated circuit (IC) ecosystem, owning a foundry is not economically viable, and therefore most IC design houses are now working under a fabless business model.  ...  Mitigating attacks towards regular structures could be done by obfuscating those structures in such a way that they become indistinguishable.  ... 
arXiv:2006.04627v2 fatcat:ie6b22vw25d35brv24ue7vlodq

Multi-Key Searchable Encryption, Revisited [chapter]

Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs
2018 Lecture Notes in Computer Science  
We provide an indistinguishability-based definition where the adversary chooses the documents and data keys belonging to the malicious data owners, and two potential values (a "left" and a "right" value  ...  We also show that high server storage overhead is not inherent, by giving an alternate (albeit impractical) construction that manages to avoid it using obfuscation. Overview of Our MKSE Definition.  ...  We would also like to thank Joseph Jaeger for pointing out a bug in an earlier version of Definition 3.1. This work was supported by NSF grants CNS-1314722, CNS-1413964, TWC-1664445 and TWC-1646671.  ... 
doi:10.1007/978-3-319-76578-5_4 fatcat:vs72r43yf5hxnmnsbnjscuh3t4

Time-Series Pattern Based Effective Noise Generation for Privacy Protection on Cloud

Gaofeng Zhang, Xiao Liu, Yun Yang
2015 IEEE transactions on computers  
Noise obfuscation is an effective approach in this regard by utilizing noise data.  ...  First, we analyze this privacy risk and present a novel cluster based algorithm to generate time intervals dynamically.  ...  We would like to express our deep gratitude to A/Prof. Jinjun Chen from University of Technology, Sydney, for his stimulating suggestions in this paper.  ... 
doi:10.1109/tc.2014.2298013 fatcat:n4bf66hdajatlnc2ealc4axg5e

New Negative Results on Differing-Inputs Obfuscation [chapter]

Mihir Bellare, Igors Stepanovs, Brent Waters
2016 Lecture Notes in Computer Science  
We provide the following negative results for differing-inputs obfuscation (diO): (1) If subexponentially secure one-way functions exist then sub-exponentially secure diO for TMs does not exist (2) If  ...  Instead we have to resort to the above approach of embedding vk into a separate TM. According to our definitions, two TMs can be functionally equivalent only if both of them halt on all inputs.  ...  Specifically, our definitions allow for a unified treatment of polynomial and sub-exponential security of both circuit and TM obfuscation. Program samplers.  ... 
doi:10.1007/978-3-662-49896-5_28 fatcat:b3ii54dy2zdihdxl25unrqswiq
« Previous Showing results 1 — 15 out of 948 results