Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 24 for “"One-Way Functions"”.
-
Computationally secure quantum cryptography without one-way functions
… can only perform efficient computations. On one hand, without this constraint many practically relevant cryptographic tasks are infeasible; on the other, this constraint still captures the power of any physical attacker with limited resources. Classically, if the task of attacking almost any …
-
The Early Development of Quantitative Cognition: Correspondences and One-Way Functions
… the child's understanding of correspondences and one-way functions informs his capacity to compare arrays of decals and quantities of liquid. The relation of Piagetian operative level to the child's capacity to use crystallized skills, or solution aids (Cattell, 1963; Horn, 1968), in comparing …
-
On the Black-Box Impossibility of Hardness in TFNP from One-Way Functions
… of TFNP from cryptographic primitives such as one-way permutations, collision-resistant hashing, indistinguishability obfuscation, factoring, and various others. However, the status of basing the hardness on a general assumption such as the existence of one-way functions remains unsuccessful. …
-
A Study of Separations in Cryptography: New Results and New Models
… (e.g., key agreement) from others (e.g., one-way functions). In this dissertation we further extend the frontier of this field by demonstrating several new impossibility results as well as a new framework for studying a more general class of constructions. Our first two results demonstrate …
-
Algorithmic Randomness and Quantum Random Number Generation
… high-quality randomness for inverting a class of one-way functions in a pre-given time.
-
Inherently quantum lower bounds on computational complexity
… in terms of decision problems and Boolean functions, whose inputs and outputs are purely classical. However, many quantum computational tasks motivated by physics, machine learning, and cryptography involve operation on quantum information in a fundamental way. In this dissertation, we …
-
Mathematical Modeling and Experimental Verification of Resonance Energy Transfer Networks: Applications in Cryptography and Biological Sensing
… employ physical keys based on algorithmic one-way functions, which are conjectured mathematical objects that are easy to compute but difficult to invert. Well-known examples of such one-way functions include the RSA and the Rabin functions. Although algorithmic one-way functions are widely …
-
THINKING INSIDE THE BOX: PRIVACY AGAINST STRONGER ADVERSARIES
… non-malleable extractors, and immunized ideal one-way functions. The thesis is divided into three main chapters. In the first chapter, we show that 2-out-of-2 leakage resilient (and also non-malleable) secret sharing requires randomness sources that are also extractable. This rules out the …
-
On computational intractability assumptions in cryptography
"In cryptographic protocols, honest parties would prefer that their security is assured even in presence of adversarial parties who have unbounded computational power. Information theoretic secure realization of cryptographic primitives provides such guarantees; but for most tasks such strong …
-
Study of Physical Unclonable Functions at Low Voltage on FPGA
Physical Unclonable Functions (PUFs) provide a secure, power efficient and non-volatile means of chip identification. These are analogous to one-way functions that are easy to create but impossible to duplicate. They offer solutions to many of the FPGA (Field Programmable Gate Array) issues like …
-
Program obfuscation: new applications and constructions from standard assumptions
Code obfuscation has been one of the main focal points of cryptographic research over the last few years. This proposed thesis studies two different aspects of program obfuscation. In the first part, we examine the power of indistinguishability obfuscation. This notion of indistinguishability …
-
Sculpting light using DNA origami-templated nanoparticle assemblies
… areas: chiral plasmonics and physical unclonable functions (PUFs). Initially, we discuss advances in the use of DNA origami-templated plasmonic materials to achieve sensitive biomolecule detection. We then explore the synthesis and properties of chiral nanorod dimers, focusing on silver-gold …
-
DGMT: A Fully Dynamic Hash-Based Group Signature
… is believed that symmetric encryptions and hash functions are resilient to attacks by a quantum adversary. Therefore, signature schemes have been modified so that their security relies on hash functions instead of the aforementioned mathematical hard problems. In this thesis, we consider …
-
Silicon Photonic Physical Unclonable Functions
… derived from algorithms which include hash functions, random sequences, one-way permutations, and ciphers. Such approaches rely on computational asymmetry, e.g. algorithms that are easy to compute, yet difficult to reverse. However, the security of such “one-way” functions is not rigorously …
-
Quantum Pseudorandom Primitives Beyond Pseudorandom States
… of pseudorandom generators and pseudorandom functions. A unitary oracle separation result between one-way functions and PRSs/PRUs, established by Kretschmer, suggests that certain quantum primitives may remain secure even if classical cryptography is compromised. This insight has spurred …
-
Concurrent Security
… protocols are analyzed in a "stand-alone" setting, where a single protocol execution takes place in isolation. In the age of the Internet, however, a great number of executions of different protocols co-exist and are tightly inter-connected. This concurrency severely undermines the …
-
Rationality and Efficient Verifiable Computation
… for delegating computation in a model where one of the parties is rational. In our model, a delegator outsources the computation of a function f on input x to a worker, who receives a (possibly monetary) reward. Our goal is to design very efficient delegation schemes where a worker is …
-
Batching in cryptography : constructing efficient ciphertexts, time-locked puzzles and proofs
… sender would construct K different ciphertexts, one for each recipient. The size of the broadcasted message then scales linearly with K. Broadcast encryption offers one solution to this problem where ciphertext size scales sublinearly with the number of recipients, but at the cost of introducing …
-
Randomness in completeness and space-bounded computations
… various polynomial-time reductions such as many-one reduction, truth-table reduction, Turing reduction, etc. Each such notion of reduction induces a notion of completeness. Finding the relationships among various NP-completeness notions is a significant open problem. Our first result is about the …
Page 1 of 2