Add to ORKGWe argue that it is unnatural and undesirable to use the non-uniform model of complexity for practice-oriented security reductions in cryptography
We investigate randomized LEARN-uniformity, which captures the power of randomness and equivalence q...
AbstractThe concept of pseudorandomness plays an important role in cryptography. In this note, we co...
We investigate computing models that are presented as families of finite computing devices with a un...
We provide a treatment of encryption and zero-knowledge in terms of uniform complexity measures. Thi...
We study properties of non-uniform reductions and related completeness notions. We strengthen severa...
We present the first truly explicit constructions of non-malleable codes against tampering by bounde...
We study properties of non-uniform reductions and related completeness notions. We strengthen severa...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
AbstractA concept of uniform complexity is defined and a class of functions is shown to have uniform...
We revisit security proofs for various cryptographic primitives in the auxiliary-input random-oracle...
We provide a symbolic model for multi-party computation based on linear secret-sharing scheme, and p...
The non-uniform version of Turing machines with an extra advice input tape that depends on the lengt...
AbstractWe obtain some results of the form: If certain complexity classes satisfy a non-uniform cond...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
We present an approach to non-uniform complexity in which single-pass instruction sequences play a k...
We investigate randomized LEARN-uniformity, which captures the power of randomness and equivalence q...
AbstractThe concept of pseudorandomness plays an important role in cryptography. In this note, we co...
We investigate computing models that are presented as families of finite computing devices with a un...
We provide a treatment of encryption and zero-knowledge in terms of uniform complexity measures. Thi...
We study properties of non-uniform reductions and related completeness notions. We strengthen severa...
We present the first truly explicit constructions of non-malleable codes against tampering by bounde...
We study properties of non-uniform reductions and related completeness notions. We strengthen severa...
grantor: University of TorontoThis thesis studies models and limitations of non-uniform co...
AbstractA concept of uniform complexity is defined and a class of functions is shown to have uniform...
We revisit security proofs for various cryptographic primitives in the auxiliary-input random-oracle...
We provide a symbolic model for multi-party computation based on linear secret-sharing scheme, and p...
The non-uniform version of Turing machines with an extra advice input tape that depends on the lengt...
AbstractWe obtain some results of the form: If certain complexity classes satisfy a non-uniform cond...
This thesis is dedicated to the study of the relations between uniform and nonuniform proof complexi...
We present an approach to non-uniform complexity in which single-pass instruction sequences play a k...
We investigate randomized LEARN-uniformity, which captures the power of randomness and equivalence q...
AbstractThe concept of pseudorandomness plays an important role in cryptography. In this note, we co...
We investigate computing models that are presented as families of finite computing devices with a un...