Search results for "pseudorandomness"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
88	Wonil Lee, Kouichi Sakurai, Seokhie Hong, Sangjin Lee 0002	On the Pseudorandomness of a Modification of KASUMI Type Permutations.	ICISC	2004	DBLP DOI BibTeX RDF	KASUMI, block cipher, provable security, Pseudorandomness
67	Henri Gilbert, Marine Minier	New Results on the Pseudorandomness of Some Blockcipher Constructions.	FSE	2001	DBLP DOI BibTeX RDF
63	Wenling Wu	Pseudorandomness of Camellia-Like Scheme.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	random function, super-pseudorandomness, block cipher, pseudorandomness, Camellia
57	Wenling Wu, Dengguo Feng, Hua Chen 0011	Collision Attack and Pseudorandomness of Reduced-Round Camellia.	Selected Areas in Cryptography	2004	DBLP DOI BibTeX RDF	Block cipher, Time complexity, Pseudorandomness, Data complexity, Camellia
47	Jacques Patarin	About Feistel Schemes with Six (or More) Rounds.	FSE	1998	DBLP DOI BibTeX RDF
42	Amparo Fúster-Sabater, Pino Caballero-Gil, Oscar Delgado-Mohatar	Deterministic Computation of Pseudorandomness in Sequences of Cryptographic Application.	ICCS (1)	2009	DBLP DOI BibTeX RDF	bit-string, run dirtribution, cryptography, Pseudorandomness, balancedness
41	Manindra Agrawal, Diptarka Chakraborty, Debarati Das 0001, Satyadev Nandakumar	Dimension, pseudorandomness and extraction of pseudorandomness.	Comput.	2017	DBLP DOI BibTeX RDF
41	Manindra Agrawal, Diptarka Chakraborty, Debarati Das 0001, Satyadev Nandakumar	Dimension, Pseudorandomness and Extraction of Pseudorandomness.	FSTTCS	2015	DBLP DOI BibTeX RDF
41	Manindra Agrawal, Diptarka Chakraborty, Debarati Das 0001, Satyadev Nandakumar	Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness.	Electron. Colloquium Comput. Complex.	2014	DBLP BibTeX RDF
37	Jin-yi Cai, Hong Zhu 0004	Progress in Computational Complexity Theory.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms
37	Serge Vaudenay	Decorrelation: A Theory for Block Cipher Security.	J. Cryptol.	2003	DBLP DOI BibTeX RDF	Cryptanalysis, Block ciphers, Pseudorandomness
37	Tetsu Iwata, Tomonobu Yoshino, Kaoru Kurosawa	Non-cryptographic Primitive for Pseudorandom Permutation.	FSE	2002	DBLP DOI BibTeX RDF	MISTY type permutation, Block cipher, pseudorandomness
37	Matthias Krause 0001, Stefan Lucks	On the Minimal Hardware Complexity of Pseudorandom Function Generators.	STACS	2001	DBLP DOI BibTeX RDF	Boolean Complexity Theory, Computational Distinguishability, Cryptography, Pseudorandomness
37	Matt Blaze, Joan Feigenbaum, Moni Naor	A Formal Treatment of Remotely Keyed Encryption.	EUROCRYPT	1998	DBLP DOI BibTeX RDF	Remotely Keyed Encryption, Smart-cards, Block Ciphers, Pseudorandomness, Session Keys
37	Adam L. Young, Moti Yung	Kleptography: Using Cryptography Against Cryptography.	EUROCRYPT	1997	DBLP DOI BibTeX RDF	Cryptanalytic attacks, leakage bandwidth, design and manufacturing of cryptographic devices and software, black-box devices, SETUP mechanisms, RSA, randomness, information hiding, pseudorandomness, Diffie-Hellman, subliminal channels, kleptography, Discrete Log
37	Adam L. Young, Moti Yung	The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems.	CRYPTO	1997	DBLP DOI BibTeX RDF	DSA signature, Menezes-Vanstone PKCS, Schnorr signature algorithm, protocol abuse, leakage-bandwidth, cryptographic system implementations, randomness, pseudorandomness, Diffie-Hellman, subliminal channels, kleptography, setup, ElGamal encryption, ElGamal signature, Discrete-Log
37	Adam L. Young, Moti Yung	The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?	CRYPTO	1996	DBLP DOI BibTeX RDF	Cryptanalytic attacks, Private key, applied systems, design and manufacturing of cryptographic devices and software, auto-escrowing keys, software, RSA, randomness, hardware, Public Key, pseudorandomness, Kerberos, key escrow, DSA, ElGamal, subliminal channels, Capstone
36	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity Via Uniform Reductions.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	Subject classification, 68Q10
36	Tetsu Iwata, Tohru Yagi, Kaoru Kurosawa	On the Pseudorandomness of KASUMI Type Permutations.	ACISP	2003	DBLP DOI BibTeX RDF
36	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity via Uniform Reductions.	CCC	2002	DBLP DOI BibTeX RDF
36	Salil P. Vadhan	Order in Pseudorandomness.	RANDOM-APPROX	2001	DBLP DOI BibTeX RDF
36	Ju-Sung Kang, Okyeon Yi, Dowon Hong, Hyun Sook Cho	Pseudorandomness of MISTY-Type Transformations and the Block Cipher KASUMI.	ACISP	2001	DBLP DOI BibTeX RDF	(Super-)Pseudorandom permutation ensemble, MISTY-type transformation, KASUMI, Distinguisher
36	Eonkyung Lee, Sangjin Lee, Sang Geun Hahn	Pseudorandomness from Braid Groups.	CRYPTO	2001	DBLP DOI BibTeX RDF
31	Scott Aaronson	BQP and the polynomial hierarchy.	STOC	2010	DBLP DOI BibTeX RDF	linial-nisan conjecture, quantum complexity classes, fourier analysis, constant-depth circuits
31	Marc Fischlin, Anja Lehmann	Multi-property Preserving Combiners for Hash Functions.	TCC	2008	DBLP DOI BibTeX RDF
31	Dengguo Feng, Weidong Chen	Modular approach to the design and analysis of password-based security protocols.	Sci. China Ser. F Inf. Sci.	2007	DBLP DOI BibTeX RDF	weak computational indistinguishability, random oracle model (ROM), provable security, security protocols, standard model
31	Yi Deng 0002, Dongdai Lin	Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability.	EUROCRYPT	2007	DBLP DOI BibTeX RDF	instance-dependent verifiable random functions, simultaneous resettability, zero knowledge
31	Rudolf Ahlswede, Christian Mauduit, András Sárközy	Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I.	GTIT-C	2006	DBLP DOI BibTeX RDF
31	Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang	On the Provable Security of an Efficient RSA-Based Pseudorandom Generator.	ASIACRYPT	2006	DBLP DOI BibTeX RDF
31	Babak Sadeghiyan, Josef Pieprzyk	On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations.	ASIACRYPT	1991	DBLP DOI BibTeX RDF
21	Matt DeVos, Ariel Gabizon	Simple Affine Extractors Using Dimension Expansion.	CCC	2010	DBLP DOI BibTeX RDF	affine extractors, dimension expansion, derandomization, Extractors, pseudorandomness
21	Liting Zhang, Wenling Wu, Lei Zhang 0012, Yanjun Li	A note on Cook's elastic block cipher.	AsiaCCS	2009	DBLP DOI BibTeX RDF	elastic block cipher, variable-input-length block cipher, encryption, block cipher, security model, pseudorandomness
21	Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola	Bounded Independence Fools Halfspaces.	FOCS	2009	DBLP DOI BibTeX RDF	k-wise independent distributions, pseudorandomness, halfspaces
21	Jesse Kamp, Anup Rao 0001, Salil P. Vadhan, David Zuckerman	Deterministic extractors for small-space sources.	STOC	2006	DBLP DOI BibTeX RDF	pseudorandomness, randomness extractors
21	Rosario Gennaro	An Improved Pseudo-Random Generator Based on the Discrete Logarithm Problem.	J. Cryptol.	2005	DBLP DOI BibTeX RDF	Discrete logarithm, Pseudorandomness
21	Ran Raz	Extractors with weak random seeds.	STOC	2005	DBLP DOI BibTeX RDF	random sources, extractors, pseudorandomness, condensers, mergers, randomness extraction, explicit constructions, Ramsey graphs
21	Andrej Bogdanov	Pseudorandom generators for low degree polynomials.	STOC	2005	DBLP DOI BibTeX RDF	derandomization, pseudorandomness
21	Venkatesan Guruswami	Better extractors for better codes?	STOC	2004	DBLP DOI BibTeX RDF	error-correcting codes, expander graphs, pseudorandomness, list decoding, randomness extractors
21	Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wigderson	Extractors: optimal up to constant factors.	STOC	2003	DBLP DOI BibTeX RDF	locally decodable error-correcting codes, pseudorandomness, condensers, randomness extractors, mergers
21	Matthias Krause 0001, Stefan Lucks	Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators
21	Luca Trevisan	Extractors and pseudorandom generators.	J. ACM	2001	DBLP DOI BibTeX RDF	Error-correcting codes, extractors, pseudorandomness
21	Johan Håstad, Avi Wigderson	Simple Analysis of Graph Tests for Linearity and PCP.	CCC	2001	DBLP DOI BibTeX RDF	graph test, pseudorandomness, PCP, Linearity testing, iterated test
21	Peter Auer, Philip M. Long, Aravind Srinivasan	Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets.	STOC	1997	DBLP DOI BibTeX RDF	approximations of distributions, machine learning, random graphs, derandomization, pseudorandomness, PAC learning, multiple-instance learning, rectangles, sample complexity, explicit constructions, Ramsey graphs
21	Samuel Bouaziz-Ermann, Garazi Muguruza	Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way.	CoRR	2024	DBLP DOI BibTeX RDF
21	Samuel Bouaziz-Ermann, Garazi Muguruza	Quantum Pseudorandomness Cannot Be Shrunk In a Black-Box Way.	IACR Cryptol. ePrint Arch.	2024	DBLP BibTeX RDF
21	Iddo Tzameret, Luming Zhang	Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness.	ITCS	2024	DBLP DOI BibTeX RDF
21	Yong Wang 0009, Zhuo Liu, Leo Yu Zhang, Fabio Pareschi, Gianluca Setti, Guanrong Chen	From Chaos to Pseudorandomness: A Case Study on the 2-D Coupled Map Lattice.	IEEE Trans. Cybern.	2023	DBLP DOI BibTeX RDF
21	Iddo Tzameret, Luming Zhang	Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness.	Electron. Colloquium Comput. Complex.	2023	DBLP BibTeX RDF
21	Iddo Tzameret, Luming Zhang	Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness.	CoRR	2023	DBLP DOI BibTeX RDF
21	Tudor Giurgica-Tiron, Adam Bouland	Pseudorandomness from Subset States.	CoRR	2023	DBLP DOI BibTeX RDF
21	Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros	Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding.	CoRR	2023	DBLP DOI BibTeX RDF
21	Emile Anand, Chris Umans	Pseudorandomness of the Sticky Random Walk.	CoRR	2023	DBLP DOI BibTeX RDF
21	Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli	Pseudorandomness with Proof of Destruction and Applications.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
21	Rupeng Yang	Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
21	Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros	Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
21	Xin Lyu 0003, Weihao Zhu	Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness.	SODA	2023	DBLP DOI BibTeX RDF
21	Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli	Pseudorandomness with Proof of Destruction and Applications.	TCC (4)	2023	DBLP DOI BibTeX RDF
21	Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard	Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based Cryptography.	ASIACRYPT (7)	2023	DBLP DOI BibTeX RDF
21	Rupeng Yang	Privately Puncturing PRFs from Lattices: Adaptive Security and Collusion Resistant Pseudorandomness.	EUROCRYPT (3)	2023	DBLP DOI BibTeX RDF
21	Cynthia Dwork, Daniel Lee, Huijia Lin, Pranay Tankala	From Pseudorandomness to Multi-Group Fairness and Back.	COLT	2023	DBLP BibTeX RDF
21	Maxime Bombar, Geoffroy Couteau, Alain Couvreur, Clément Ducros	Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding.	CRYPTO (4)	2023	DBLP DOI BibTeX RDF
21	Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman	Nearly Optimal Pseudorandomness from Hardness.	J. ACM	2022	DBLP DOI BibTeX RDF
21	Venkatesan Guruswami, Xin Lyu, Xiuhan Wang	Range Avoidance for Low-depth Circuits and Connections to Pseudorandomness.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
21	Louis Golowich, Salil P. Vadhan	Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
21	Xin Lyu 0003, Weihao Zhu	Time-Space Tradeoffs for Element Distinctness and Set Intersection via Pseudorandomness.	CoRR	2022	DBLP DOI BibTeX RDF
21	Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl	Correlated Pseudorandomness from Expand-Accumulate Codes.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard	On The Pseudorandomness of the Decoding Problem via the Oracle Comparison Problem.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett	High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games.	SODA	2022	DBLP DOI BibTeX RDF
21	Rahul Ilango, Hanlin Ren, Rahul Santhanam	Robustness of average-case meta-complexity via pseudorandomness.	STOC	2022	DBLP DOI BibTeX RDF
21	Venkatesan Guruswami, Xin Lyu, Xiuhan Wang	Range Avoidance for Low-Depth Circuits and Connections to Pseudorandomness.	APPROX/RANDOM	2022	DBLP DOI BibTeX RDF
21	Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl	Correlated Pseudorandomness from Expand-Accumulate Codes.	CRYPTO (2)	2022	DBLP DOI BibTeX RDF
21	Louis Golowich, Salil P. Vadhan	Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs.	CCC	2022	DBLP DOI BibTeX RDF
21	Sourya Roy	A Study of Pseudorandomness and its Applications to Coding Theory.		2022	RDF
21	Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan	Monotone Branching Programs: Pseudorandomness and Circuit Complexity.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
21	Mina Doosti, Niraj Kumar, Elham Kashefi, Kaushik Chakraborty	On the Connection Between Quantum Pseudorandomness and Quantum Hardware Assumptions.	CoRR	2021	DBLP BibTeX RDF
21	William Kretschmer	Quantum Pseudorandomness and Classical Complexity.	CoRR	2021	DBLP BibTeX RDF
21	Aayush Jain, Alexis Korb, Paul Lou, Amit Sahai	A Note on the Pseudorandomness of Low-Degree Polynomials over the Integers.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
21	Huaning Liu, Xiaolin Chen	On pseudorandom subsets in finite fields I: measure of pseudorandomness and support of Boolean functions.	Period. Math. Hung.	2021	DBLP DOI BibTeX RDF
21	William Kretschmer	Quantum Pseudorandomness and Classical Complexity.	TQC	2021	DBLP DOI BibTeX RDF
21	Max Hopkins, Tali Kaufman, Shachar Lovett	High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games.	Electron. Colloquium Comput. Complex.	2020	DBLP BibTeX RDF
21	Hassan Aly, Arne Winterhof	A Note on Hall's Sextic Residue Sequence: Correlation Measure of Order $k$ and Related Measures of Pseudorandomness.	IEEE Trans. Inf. Theory	2020	DBLP DOI BibTeX RDF
21	Max Hopkins, Tali Kaufman, Shachar Lovett	High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games.	CoRR	2020	DBLP BibTeX RDF
21	Adam Bouland, Bill Fefferman, Umesh V. Vazirani	Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract).	ITCS	2020	DBLP DOI BibTeX RDF
21	Rahul Santhanam	Pseudorandomness and the Minimum Circuit Size Problem.	ITCS	2020	DBLP DOI BibTeX RDF
21	Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman	Nearly Optimal Pseudorandomness From Hardness.	FOCS	2020	DBLP DOI BibTeX RDF
21	Pratik Soni	Transforming Pseudorandomness and Non-malleability with Minimal Overheads.		2020	RDF
21	Russell Impagliazzo, Raghu Meka, David Zuckerman	Pseudorandomness from Shrinkage.	J. ACM	2019	DBLP DOI BibTeX RDF
21	Rahul Santhanam	Pseudorandomness and the Minimum Circuit Size Problem.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
21	Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman	Nearly Optimal Pseudorandomness From Hardness.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
21	Tobias Christiani	Algorithms for Similarity Search and Pseudorandomness.	CoRR	2019	DBLP BibTeX RDF
21	Adam Bouland, Bill Fefferman, Umesh V. Vazirani	Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality.	CoRR	2019	DBLP BibTeX RDF
21	Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt 0002, Amit Sahai	Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
21	Emanuele Viola	Constant-Error Pseudorandomness Proofs from Hardness Require Majority.	ACM Trans. Comput. Theory	2019	DBLP DOI BibTeX RDF
21	Rocco A. Servedio, Li-Yang Tan	Pseudorandomness for read-k DNF formulas.	SODA	2019	DBLP DOI BibTeX RDF
21	Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt 0002, Amit Sahai	Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.	CRYPTO (3)	2019	DBLP DOI BibTeX RDF
21	László Mérai, Arne Winterhof	On the pseudorandomness of automatic sequences.	Cryptogr. Commun.	2018	DBLP DOI BibTeX RDF
21	Shuai Han 0001, Shengli Liu 0001, Baodong Qin, Dawu Gu	Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness.	Des. Codes Cryptogr.	2018	DBLP DOI BibTeX RDF
21	Emanuele Viola	Constant-error pseudorandomness proofs from hardness require majority.	Electron. Colloquium Comput. Complex.	2018	DBLP BibTeX RDF
21	Maciej Skorski	Pseudorandomness Against Mean and Variance Bounded Attackers.	IACR Cryptol. ePrint Arch.	2018	DBLP BibTeX RDF
21	Prabhanjan Ananth, Aayush Jain, Dakshita Khurana, Amit Sahai	Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.	IACR Cryptol. ePrint Arch.	2018	DBLP BibTeX RDF