• Corpus ID: 9010929

Benchmarking Obfuscators of Functionality

@article{Thomborson2015BenchmarkingOO,
  title={Benchmarking Obfuscators of Functionality},
  author={Clark D. Thomborson},
  journal={ArXiv},
  year={2015},
  volume={abs/1501.02885}
}
  • C. Thomborson
  • Published 12 January 2015
  • Computer Science, Mathematics
  • ArXiv
We propose a set of benchmarks for evaluating the practicality of software obfuscators which rely on provably-secure methods for functional obfuscation. 
1 Citations

MULTIFACTOR AUTHENTICATION FOR SOFTWARE PROTECTION

TLDR
Two schemes are proposed to achieve effective software protection tools based on the use of multifactor authentication techniques and steganography algorithms that are able to provide immunity against illegal accesses by invaders.

References

SHOWING 1-10 OF 16 REFERENCES

Secure Multiparty Computation Goes Live

TLDR
The first large-scale and practical application of secure multiparty computation, which took place in January 2008, is reported on and the novel cryptographic protocols used are reported on.

Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

TLDR
This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and shows how to use them together with Fully Homomorphic Encryption to achieve functional encryption for all circuits.

Performance evaluation of Intel® Transactional Synchronization Extensions for high-performance computing

TLDR
The first hardware implementation of Intel TSX is evaluated using a set of high-performance computing (HPC) workloads, and it is demonstrated that applying IntelTSX to these workloads can provide significant performance improvements.

Width-bounded reducibility and binary search over complexity classes

TLDR
It is shown that reductions of simultaneously restricted width and depth provide a characterization of binary search over complexity classes, as introduced by K. Wagner and S. Wagner (1989) and K. Buss and L. Hay (1988).

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

TLDR
The method of proof is extended to investigate the complexity of the word problem for a fixed permutation group and show that polynomial size circuits of width 4 also recognize exactly nonuniform NC 1.

The economics of large-memory computations

  • C. Thomborson
  • Computer Science
    Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing
  • 1997
TLDR
It is suggested that computer users should be charged a "rental" cost, proportional to their use of the total capacity in a hierarchical memory system, to ensure sufficient memory bandwidth and processor speed in any "well-formed" system of a given latency and size.

On simultaneous resource bounds

  • N. Pippenger
  • Computer Science
    20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
TLDR
It is shown here that simultaneous time and "reversal" bounds correspond to simultaneous size and depth bounds, and that simultaneousTime and space bounds Correspond to simultaneousSize and "width" bounds.

Models of computation - exploring the power of computing

TLDR
In Models of Computation, John Savage re-examines theoretical computer science, offering a fresh approach that gives priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages.

Complexity Theory of Parallel Time and Hardware

Broad agen cy a nouncement: SafeWare DARPA-BAA-14-65

  • Sep. 2014.
  • 2014