Filters








27,655 Hits in 3.0 sec

Oracle Separation in the Non-uniform Model [chapter]

Ahto Buldas, Sven Laur, Margus Niitsoo
2009 Lecture Notes in Computer Science  
To overcome this gap, randomized oracles are used to create random base primitives that are secure on average.  ...  In this work, we show how to adapt oracle separation results to the non-uniform security model.  ...  Conclusions We showed that oracle separation can be used in the non-uniform model with minor restrictions that should hold for almost all practical separations anyway.  ... 
doi:10.1007/978-3-642-04642-1_19 fatcat:m5xvn2w7dnaf5g4xmhzwtrfdya

On the power of nonuniformity in proofs of security

Kai-Min Chung, Huijia Lin, Mohammad Mahmoody, Rafael Pass
2013 Proceedings of the 4th conference on Innovations in Theoretical Computer Science - ITCS '13  
We first show that a known protocol (based on the existence of one-way permutations) that uses a nonuniform proof of security, and it cannot be proven secure through a uniform security reduction.  ...  In this paper, we initiate a formal study of the power and limits of nonuniform black-box proofs of security.  ...  We let the randomized oracle O be the random oracle.  ... 
doi:10.1145/2422436.2422480 dblp:conf/innovations/ChungLMP13 fatcat:z5un4rarmjghdlbijfuryzzt6a

Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle

Dylan M. McKay, Richard Ryan Williams, Michael Wagner
2018 Innovations in Theoretical Computer Science  
answers with constant nonzero probability, even for algorithms with constant-time access to a uniform random oracle (i.e., a uniform random hash function): Given an unordered list L of n elements from  ...  SICOMP 1991] to apply in the case of random oracles.  ...  Acknowledgements We thank the anonymous reviewers for helpful comments. 1 Parts of this work were performed while visiting the Simons Institute for the Theory of Computing and the EECS department at UC  ... 
doi:10.4230/lipics.itcs.2019.56 dblp:conf/innovations/McKayW19 fatcat:prlyjqud5vgujafxl7vtbkaco4

On obfuscating point functions

Hoeteck Wee
2005 Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05  
non-uniform advice in our simulator) are in some sense inherent.  ...  We stress that prior to this work, what is known about obfuscation are negative results for the general class of circuits [BGI+01] and positive results in the random oracle model [LPS04] or under non-standard  ...  and discussions.  ... 
doi:10.1145/1060590.1060669 dblp:conf/stoc/Wee05 fatcat:iy6jr5ap7bhsfgahlqymhxf5xu

Stronger Security Bounds for Wegman-Carter-Shoup Authenticators [chapter]

Daniel J. Bernstein
2005 Lecture Notes in Computer Science  
Here m is a message; n is a nonce chosen from a public group G; f is a secret uniform random permutation of G; h is a secret random function; and is a differential probability associated with h.  ...  The heart of the paper is a very general "one-sided" security theorem: (n, m) → h(m) + f (n) is secure if there are small upper bounds on differential probabilities for h and on interpolation probabilities  ...  independent non-uniform random 2-byte strings.  ... 
doi:10.1007/11426639_10 fatcat:pd2u3i2zknalzj5ry4uy65qiii

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

Gilad Asharov, Gil Segev
2016 SIAM journal on computing (Print)  
non-black-box ingredient • Public-key encryption, short "hash- and-sign" signatures, CCA-secure public-key encryption, non- interactive zero-knowledge proofs, Injective trapdoor functions, oblivious  ...  oracles [HSW14] • Multi-input functional encryption [GGG+14, AJ15] • Functional encryption for randomized functionalities [GJK+15] • Adaptively-secure multiparty computation [GGH+14a, CGP15,  ...  iO as follows: • On input oracle-aided circuit C (with |C|=n), choose a random r We Need to Prove  ... 
doi:10.1137/15m1034064 fatcat:mpwjp5fvhnbxzgxq3dlvy27vfe

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

Gilad Asharov, Gil Segev
2015 2015 IEEE 56th Annual Symposium on Foundations of Computer Science  
non-black-box ingredient • Public-key encryption, short "hash- and-sign" signatures, CCA-secure public-key encryption, non- interactive zero-knowledge proofs, Injective trapdoor functions, oblivious  ...  oracles [HSW14] • Multi-input functional encryption [GGG+14, AJ15] • Functional encryption for randomized functionalities [GJK+15] • Adaptively-secure multiparty computation [GGH+14a, CGP15,  ...  iO as follows: • On input oracle-aided circuit C (with |C|=n), choose a random r We Need to Prove  ... 
doi:10.1109/focs.2015.21 dblp:conf/focs/AsharovS15 fatcat:f4doowce6rdkzh7e4h7qw5pkna

Randomness vs Time: Derandomization under a Uniform Assumption

Russell Impagliazzo, Avi Wigderson
2001 Journal of computer and system sciences (Print)  
Either time can non-trivially substitute for randomness, or randomness can non-trivially substitute for time.  ...  This class is quite interesting, and we trivially have: Non-uniformity is essential; one can construct non-recursive elements of LEARN by taking a parameterized family of concept classes exactly learnable  ... 
doi:10.1006/jcss.2001.1780 fatcat:iqrss6b62vcrxmqd2mbii3oxcu

Random Oracles with(out) Programmability [chapter]

Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Thomas Shrimpton, Martijn Stam, Stefano Tessaro
2010 Lecture Notes in Computer Science  
Our negative results use a new concrete-security variant of Hsiao and Reyzin's two-oracle separation technique.  ...  This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ideal hash function.  ...  (and uniform) de-randomization techniques based on the Borel-Cantelli lemma.  ... 
doi:10.1007/978-3-642-17373-8_18 fatcat:yf6p7zxvqncqhkmcv7xiqhdjtq

Statistical Randomized Encodings: A Complexity Theoretic View [chapter]

Shweta Agrawal, Yuval Ishai, Dakshita Khurana, Anat Paskin-Cherniavsky
2015 Lecture Notes in Computer Science  
Our candidate promise problems and languages are based on the standard Learning with Errors (LWE) assumption, a non-standard variant of the Decisional Diffie Hellman (DDH) assumption and the "Abelian Subgroup  ...  A randomized encoding of a function f (x) is a randomized functionf (x, r), such that the "encoding"f (x, r) reveals f (x) and essentially no additional information about x.  ...  The SREs are uniform and private against non-uniform adversaries. If not a language, we exhibit a promise problem.  ... 
doi:10.1007/978-3-662-47672-7_1 fatcat:orihdksr3fa25mx2okutbgjqoe

Computational Extractors and Pseudorandomness [chapter]

Dana Dachman-Soled, Rosario Gennaro, Hugo Krawczyk, Tal Malkin
2012 Lecture Notes in Computer Science  
extractors that use a one-way permutation as an oracle.  ...  By relaxing the statistical closeness property of traditional randomness extractors one hopes to improve the efficiency and entropy parameters of these extractors, while keeping their utility for cryptographic  ...  Unconditional Lower Bounds in the Concrete, Non-uniform Setting We start by adapting the definition of (oracle) computational extractors to the non-uniform and concrete (i.e., non-asymptotic) complexity  ... 
doi:10.1007/978-3-642-28914-9_22 fatcat:x3dlclzc5bfrdjr4mwsqa33kni

Tight Quantum Time-Space Tradeoffs for Function Inversion [article]

Kai-Min Chung, Siyao Guo, Qipeng Liu, Luowen Qian
2020 arXiv   pre-print
Recent works by Hhan, Xagawa, and Yamakawa (2019), and Chung, Liao, and Qian (2019) extended the argument for random functions and quantum advice, but the lower bound remains ST^2 = Ω̃(N).  ...  Investigation of this problem in the quantum setting was initiated by Nayebi, Aaronson, Belovs, and Trevisan (2015), who proved a lower bound of ST^2 = Ω̃(N) for random permutations against classical advice  ...  Post-Quantum Non-Uniform Security It turns out that our techniques for proving the two results above are fairly general, and we can use it to prove a variety of quantum non-uniform lower bounds.  ... 
arXiv:2006.05650v2 fatcat:tib4rclksbf7lm7dnubrwobjtm

DCMA

Olivier Teytaud, Sylvain Gelly
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
The modification is very easy to do, the modified algorithm is computationally more efficient and its convergence is faster in terms of the number of iterates for a given precision.  ...  We here replace these random independent Gaussian mutations by a quasi-random sample.  ...  Hansen for kindly providing his implementation of CMAES in Octave/Matlab, the authors of GNU-Octave for having freely distributed Octave, and the authors of [4] for having freely provided their datasets  ... 
doi:10.1145/1276958.1277150 dblp:conf/gecco/TeytaudG07 fatcat:hzerfbmkmvewxcoij6xiz4u5qe

Quantum Algorithms for Learning and Testing Juntas

Alp Atıcı, Rocco A. Servedio
2007 Quantum Information Processing  
O(2^k (1/ϵ)) random examples.  ...  Instead, our algorithms use only classical examples generated uniformly at random and fixed quantum superpositions of such classical examples; - which require only a few quantum examples but possibly many  ...  Quantum oracles: We will consider the following quantum oracles, which are the natural quantum generalizations of membership queries and uniform random examples respectively.  ... 
doi:10.1007/s11128-007-0061-6 fatcat:22qimfm6gfcztnfp5j42qb5aym

Uniform Generation of NP-Witnesses Using an NP-Oracle

Mihir Bellare, Oded Goldreich, Erez Petrank
2000 Information and Computation  
This improves upon results of Jerrum, Valiant and Vazirani, which either require a P 2 oracle or obtain only almost uniform generation.  ...  We present a Uniform Generation procedure for N P that runs in probabilistic polynomial-time with an NP-oracle.  ...  Later, Petrank and Tardos 17 showed that S K C log A M co,AM; this nal result did not use uniform generation. Shared randomness in two prover proofs.  ... 
doi:10.1006/inco.2000.2885 fatcat:ikae7o4ievhqlh22mnrs6p2dsq
« Previous Showing results 1 — 15 out of 27,655 results