Results 241 to 250 of about 15,028 (280)
Some of the next articles are maybe not open access.

On obfuscating point functions

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, 2005
We investigate the possibility of obfuscating point functions in the framework of Barak et al. from Crypto '01. A point function is a Boolean function that assumes the value 1 at exactly one point. Our main results are as follows:We provide a simple construction of efficient obfuscators for point functions for a slightly relaxed notion of obfuscation ...
openaire   +2 more sources

Identifying the applied obfuscation method towards de-obfuscation

2016 IEEE/ACIS 15th International Conference on Computer and Information Science (ICIS), 2016
Recently, to prevent cracking, the various protection methods have been proposed. One of the protection methods is the obfuscation method. Obfuscation method changes the program into hard to understand for hiding secret information in the program. On the other hand, de-obfuscation is an interesting research topic for protecting the software.
Hayato Sagisaka, Haruaki Tamada
openaire   +1 more source

Obfuscated volume rendering

The Visual Computer, 2015
Analyzing and processing various data types in a privacy-preserving perspective has been researched in many disciplines; however, such an issue draws very limited attention in the research field of scientific visualization. We wondered if it is possible to delegate the rendering of a volume data set to a remote server(s) while still being able to ...
Chou, J.-K, Yang, C.-K.
openaire   +2 more sources

Obfuscation

2015
How we can evade, protest, and sabotage today's pervasive digital surveillance by deploying more data, not less—and why we should. With Obfuscation, Finn Brunton and Helen Nissenbaum mean to start a revolution. They are calling us not to the barricades but to our computers, offering us ways to fight today's pervasive digital surveillance—
Finn Brunton, Helen Nissenbaum
openaire   +1 more source

Obfuscation from Polynomial Hardness: Beyond Decomposable Obfuscation

2018
Every known construction of general indistinguishability obfuscation (\(\mathsf {i}\mathcal {O}\)) is either based on a family of exponentially many assumptions, or is based on a single assumption – e.g. functional encryption (\(\mathsf {FE}\)) – using a reduction that incurs an exponential loss in security.
Yuan Kang   +3 more
openaire   +3 more sources

Vertical Bargaining and Obfuscation

2022
Firms often take actions that make it more difficult for consumers to gather information about the prices of products. These practices are widespread in many markets—by both the retailers that sell directly to consumers and, often, by product manufacturers. For instance, manufacturers can obscure prices by imposing different restrictions that limit the
openaire   +2 more sources

Lockable Obfuscation

2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 2017
Rishab Goyal   +2 more
openaire   +2 more sources

Eschew obfuscation

Obstetrics & Gynecology, 1996
E A, Friedman, J A, Pennisi
openaire   +2 more sources

Obfuscation, Revisited

Journal of the American Society of Echocardiography, 2010
openaire   +2 more sources

Home - About - Disclaimer - Privacy