How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
Abstract
We give a set of conditions that allow one to generate 50–50 unpredictable bits.Based on those conditions, we present a general algorithmic scheme for constructing polynomial-time deterministic algorithms that stretch a short secret random input into a long sequence of unpredictable pseudo-random bits.
We give an implementation of our scheme and exhibit a pseudo-random bit generator for which any efficient strategy for predicting the next output bit with better than 50–50 chance is easily transformable to an “equally efficient” algorithm for solving the discrete logarithm problem. In particular: if the discrete logarithm problem cannot be solved in probabilistic polynomial time, no probabilistic polynomial-time algorithm can guess the next output bit better than by flipping a coin: if “head” guess “0”, if “tail” guess “1”
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, Proc. 20th IEEE Symposium on Foundations of Computer Science, 1979, 55–60
2.
Leonard Adleman, Kenneth Manders, Gary Miller, On taking roots in finite fields, 18th Annual Symposium on Foundations of Computer Science (Providence, R.I., 1977), IEEE Comput. Sci., Long Beach, Calif., 1977, 175–178
3.
E. Bach, How to generate random integers with known factorization, Proc. 15th ACM Symposium on Theory of Computing, 1983
4.
H. Beker, F. Piper, Cipher Systems, Northwood, 1982
5.
E. Berlekamp, Factoring polynomials over large finite fields, Math. Comp., 24 (1970), 713–735
6.
Piotr Berman, Relationship between density and deterministic complexity of NP-complete languagesAutomata, languages and programming (Fifth Internat. Colloq., Udine, 1978), Lecture Notes in Comput. Sci., Vol. 62, Springer, Berlin, 1978, 63–71
7.
M. Blum, How to exchange (secret) keys, Proc.15th ACM Symposium on Theory of Computing, 1983
8.
M. Blum, Three applications of the oblivious transfer, 1981, unpublished manuscript
9.
L. Blum, M. Blum, M. Shub, A simple secure pseudo-random number generator, Proc. CRYPTO-82, Allen Gersho, ed.; this Journal, to appear
10.
Manuel Blum, Silvio Micali, How to generate cryptographically strong sequences of pseudorandom bits23rd annual symposium on foundations of computer science (Chicago, Ill., 1982), IEEE, New York, 1982, 112–117
11.
S. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symposium on Theory of Computing, 1971, 151–158
12.
Steven Fortune, A note on sparse complete sets, SIAM J. Comput., 8 (1979), 431–433
13.
Shafi Goldwasser, Silvio Micali, Probabilistic encryption, J. Comput. System Sci., 28 (1984), 270–299
14.
Shafi Goldwasser, Silvio Micali, Po Tong, Why and how to establish a private code on a public network23rd annual symposium on foundations of computer science (Chicago, Ill., 1982), IEEE, New York, 1982, 134–144
15.
S. Goldwasser, S. Micali, A. Yao, Strong signature schemes and authentication, Proc. 15th ACM Symposium on Theory of Computing, 1983
16.
R. Karp, R. Miller, J. Thatcher, Reducibility among combinatorial problemsComplexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), Plenum, New York, 1972, 85–103
17.
D. Knuth, The art of computer programming. Vol. 2, Addison-Wesley Publishing Co., Reading, Mass., 1981xiii+688, Seminumerical Algorithms
18.
A. Kolmogorov, Three approaches to the definition of the concept “quantity of information”, Problemy Peredači Informacii, 1 (1965), 3–11
19.
L. A. Levin, Universal sequential search problems, Probl. of Inf. Transm., 9 (1973), 265–266
20.
M. Luby, S. Micali, C. Rackoff, The MiRackoLus exchange of a secret bit, Proc. 24th IEEE Symposium on Foundations of Computer Science, 1983
21.
S. Mahaney, Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis21st Annual Symposium on Foundations of Computer Science (Syracuse, N.Y., 1980), IEEE, New York, 1980, 54–60
22.
A. Meyer, M. Peterson, With what frequency are apparently intractable problems difficult?, Tech. Report, Massachusetts Institute of Technology, Cambridge, MA, 1979, Feb.
23.
G. Miller, Riemann's hypothesis and tests for primality, J. Comput. System Sci., 13 (1976), 300–317
24.
G. Peterson, Succint representations, random strings and complexity classes, Proc. 21st IEEE Symposium on Foundations of Computer Science, 1980, 86–95
25.
J. Plumstead, Inferring a sequence generated by a linear congruence23rd annual symposium on foundations of computer science (Chicago, Ill., 1982), IEEE, New York, 1982, 153–159
26.
S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over ${\rm GF}(p)$ and its cryptographic significance, IEEE Trans. Information Theory, IT-24 (1978), 106–110
27.
R. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Comm. ACM, 21 (1978), 120–126
28.
J. Rosser, Lowell Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math., 6 (1962), 64–94
29.
Adi Shamir, On the generation of cryptographically strong pseudorandom sequencesAutomata, languages and programming (Akko, 1981), Lecture Notes in Comput. Sci., Vol. 115, Springer, Berlin, 1981, 544–550
30.
Daniel Shanks, Solved and unsolved problems in number theory, Chelsea Publishing Co., New York, 1978xiii+258
31.
M. Sipser, Three approaches to a definition of finite state randomness, 1979, unpublished manuscript
32.
R. Solovay, V. Strassen, A fast Monte-Carlo test for primality, SIAM J. Comput., 6 (1977), 84–85
33.
A. Yao, Theory and applications of trapdoor functions23rd annual symposium on foundations of computer science (Chicago, Ill., 1982), IEEE, New York, 1982, 80–91
34.
Andrew Odlizko, 1984, private communication
Information & Authors
Information
Published In
Copyright
Copyright © 1984 Society for Industrial and Applied Mathematics.
History
Submitted: 11 April 1983
Accepted: 15 January 1984
Published online: 13 July 2006
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- On One-Way Functions, the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity, and Computational DepthTheory of Cryptography | 2 December 2024
- Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing AssumptionJournal of Cryptology, Vol. 37, No. 4 | 19 August 2024
- Encryption-Based Attack Detection Scheme for Multisensor Secure Fusion EstimationIEEE Transactions on Aerospace and Electronic Systems, Vol. 60, No. 5 | 1 Oct 2024
- Practical and Robust Federated Learning With Highly Scalable Regression TrainingIEEE Transactions on Neural Networks and Learning Systems, Vol. 35, No. 10 | 1 Oct 2024
- SecSCS: A User-Centric Secure Smart Camera System Based on Blockchain2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS) | 23 Jul 2024
- Simple Constructions from (Almost) Regular One-Way FunctionsJournal of Cryptology, Vol. 37, No. 3 | 30 May 2024
- Provably-Secure One-Message Unilateral Entity Authentication SchemesIEEE Transactions on Dependable and Secure Computing, Vol. 21, No. 4 | 1 Jul 2024
- A conceptually simple and generic construction of plaintext checkable encryption in the standard modelDesigns, Codes and Cryptography, Vol. 92, No. 6 | 24 February 2024
- Fast Attack Detection for Cyber–Physical Systems Using Dynamic Data EncryptionIEEE Transactions on Cybernetics, Vol. 54, No. 5 | 1 May 2024
- Prism: Pr ivacy-Preserving and Ver i fiable S et Computation Over M ulti-Owner Secret Shared Outsourced DatabasesIEEE Transactions on Dependable and Secure Computing, Vol. 21, No. 3 | 1 May 2024
- Inverses of r-primitive k-normal elements over finite fieldsThe Ramanujan Journal, Vol. 63, No. 3 | 24 October 2023
- r -primitive k -normal elements in arithmetic progressions over finite fieldsCommunications in Algebra, Vol. 52, No. 1 | 16 August 2023
- Learning Burnside Homomorphisms with Rounding and Pseudorandom FunctionInnovative Security Solutions for Information Technology and Communications | 21 January 2024
- Pseudorandom Number GeneratorsCryptography and Cryptanalysis in Java | 14 July 2024
- Beyond the Csiszár–Körner Bound: Best-Possible Wiretap Coding via ObfuscationJournal of Cryptology, Vol. 37, No. 1 | 18 October 2023
- Privacy-Preserving Federated Learning Against Label-Flipping Attacks on Non-IID DataIEEE Internet of Things Journal, Vol. 11, No. 1 | 1 Jan 2024
- Secure Distributed Fusion Estimation Under Double Layer Defense ArchitectureIEEE Transactions on Industrial Cyber-Physical Systems, Vol. 2 | 1 Jan 2024
- Coupled Quadratic Congruential Random Number Generator-Aided Measurement Matrix ConstructionIEEE Transactions on Instrumentation and Measurement, Vol. 73 | 1 Jan 2024
- Efficient secure aggregation for privacy-preserving federated learning based on secret sharingJUSTC, Vol. 54, No. 1 | 1 Jan 2024
- BalancedSecAgg: Toward Fast Secure Aggregation for Federated LearningIEEE Access, Vol. 12 | 1 Jan 2024
- Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machinesNature Communications, Vol. 14, No. 1 | 2 February 2023
- Creating and detecting specious randomnessEPJ Quantum Technology, Vol. 10, No. 1 | 30 January 2023
- Random Number Generators: Principles and ApplicationsCryptography, Vol. 7, No. 4 | 30 October 2023
- Certified Hardness vs. Randomness for Log-Space2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- Polynomial-Time Pseudodeterministic Construction of Primes2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) | 6 Nov 2023
- Uncloneable CryptographyCommunications of the ACM, Vol. 66, No. 11 | 20 October 2023
- An Improved Federated Learning-Assisted Data Aggregation Scheme for Smart GridsApplied Sciences, Vol. 13, No. 17 | 30 August 2023
- An efficient and secure recommendation system based on federated matrix factorization in digital economyPersonal and Ubiquitous Computing, Vol. 27, No. 4 | 30 January 2022
- FLAP: Federated Learning Aggregation Scheme Based on Privileged Secret Sharing2023 International Conference on Networking and Network Applications (NaNA) | 1 Aug 2023
- Primitive normal values of rational functions over finite fieldsJournal of Algebra and Its Applications, Vol. 22, No. 07 | 6 May 2022
- Privacy-Preserving Federated Singular Value DecompositionApplied Sciences, Vol. 13, No. 13 | 21 June 2023
- Guest Column: New ways of studying the BPP = P conjectureACM SIGACT News, Vol. 54, No. 2 | 14 June 2023
- Hardness Self-Amplification: Simplified, Optimized, and UnifiedProceedings of the 55th Annual ACM Symposium on Theory of Computing | 2 June 2023
- Pairs of r-Primitive and k-Normal Elements in Finite FieldsBulletin of the Brazilian Mathematical Society, New Series, Vol. 54, No. 2 | 13 April 2023
- A Reinforcement Learning System for Generating Instantaneous Quality Random SequencesIEEE Transactions on Artificial Intelligence, Vol. 4, No. 3 | 1 Jun 2023
- Toward Basing Cryptography on the Hardness of EXPCommunications of the ACM, Vol. 66, No. 5 | 21 April 2023
- Weak Zero-Knowledge beyond the Black-Box BarrierSIAM Journal on Computing, Vol. 52, No. 2 | 27 January 2022
- A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithmJournal of Information Security and Applications, Vol. 73 | 1 Mar 2023
- Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptographyIET Information Security, Vol. 17, No. 2 | 29 August 2022
- On Pseudorandomness and Deep Learning: A Case StudyApplied Sciences, Vol. 13, No. 5 | 6 March 2023
- One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable DistributionsAdvances in Cryptology – CRYPTO 2023 | 9 August 2023
- When Messages Are Keys: Is HMAC a Dual-PRF?Advances in Cryptology – CRYPTO 2023 | 9 August 2023
- Randomness Quality and Trade-Offs for CA Random String GeneratorsReachability Problems | 5 October 2023
- On One-Way Functions and Sparse LanguagesTheory of Cryptography | 27 November 2023
- A Crypto-Assisted Approach for Publishing Graph Statistics with Node Local Differential Privacy2022 IEEE International Conference on Big Data (Big Data) | 17 Dec 2022
- On the existence of pairs of primitive normal elements over finite fieldsSão Paulo Journal of Mathematical Sciences, Vol. 16, No. 2 | 6 April 2021
- Hardness Self-Amplification from Feasible Hard-Core Sets2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2022
- A Federated Multi-Server Knowledge Graph Embedding Framework For Link Prediction2022 IEEE 34th International Conference on Tools with Artificial Intelligence (ICTAI) | 1 Oct 2022
- A Novel Nonlinear Pseudorandom Sequence Generator for the Fractal FunctionFractal and Fractional, Vol. 6, No. 10 | 13 October 2022
- Physical security in the post-quantum eraJournal of Cryptographic Engineering, Vol. 12, No. 3 | 1 February 2021
- Design and implementation of a novel cryptographically secure pseudorandom number generatorJournal of Cryptographic Engineering, Vol. 12, No. 3 | 24 August 2022
- A Gift that Keeps on Giving: The Impact of Public-Key Cryptography on Theoretical Computer ScienceDemocratizing Cryptography | 26 August 2022
- A Note on Perfect Correctness by DerandomizationJournal of Cryptology, Vol. 35, No. 3 | 13 May 2022
- On the connection between quantum pseudorandomness and quantum hardware assumptionsQuantum Science and Technology, Vol. 7, No. 3 | 29 April 2022
- Method for Approximating RSA Prime FactorsEICC 2022: Proccedings of the European Interdisciplinary Cybersecurity Conference | 21 July 2022
- Privacy-Preserving Distributed Estimation Over Multitask NetworksIEEE Transactions on Aerospace and Electronic Systems, Vol. 58, No. 3 | 1 Jun 2022
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing LogspaceSIAM Journal on Computing, Vol. 51, No. 2 | 9 March 2021
- A privacy-preserving and verifiable federated learning method based on blockchainComputer Communications, Vol. 186 | 1 Mar 2022
- Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) | 1 Feb 2022
- Decentralised Learning in Federated Deployment EnvironmentsACM Computing Surveys, Vol. 54, No. 1 | 11 February 2021
- Pseudorandom Number GeneratorsCryptography and Cryptanalysis in Java | 16 April 2022
- Genetic Algorithm-Based Pseudo Random Number Generation for Cloud SecurityArtificial Intelligence for Cloud and Edge Computing | 13 January 2022
- Generation of Pseudo-random Sequences of the Maximum Period Using Elliptic Curves TransformationsMathematical Modeling and Simulation of Systems | 23 February 2022
- Methods of Evaluation and Comparative Research of Cryptographic ConversionsInformation Security Technologies in the Decentralized Distributed Networks | 4 April 2022
- A Survey on Delegated ComputationDevelopments in Language Theory | 6 May 2022
- Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via ObfuscationAdvances in Cryptology – CRYPTO 2022 | 13 October 2022
- Bet-or-Pass: Adversarially Robust Bloom FiltersTheory of Cryptography | 21 December 2022
- Secure Asynchronous Federated Learning for Edge Computing DevicesSecurity and Privacy in Social Networks and Big Data | 9 October 2022
- Mature industrial functionsCyberphysical Infrastructures in Power Systems | 1 Jan 2022
- Private Computation of Phylogenetic Trees Based on Quantum TechnologiesIEEE Access, Vol. 10 | 1 Jan 2022
- SecDT: Privacy-Preserving Outsourced Decision Tree Classification Without Polynomial Forms in Edge-Cloud ComputingIEEE Transactions on Signal and Information Processing over Networks, Vol. 8 | 1 Jan 2022
- Evaluating the Performance of Novel JWT Revocation StrategyActa Cybernetica, Vol. 25, No. 2 | 4 August 2021
- LXM: better splittable pseudorandom number generators (and almost as fast)Proceedings of the ACM on Programming Languages, Vol. 5, No. OOPSLA | 15 October 2021
- Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?Journal of Cryptology, Vol. 34, No. 4 | 11 August 2021
- PFLM: Privacy-preserving federated learning with membership proofInformation Sciences, Vol. 576 | 1 Oct 2021
- A Federated Recommendation System Based on Local Differential Privacy Clustering2021 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/IOP/SCI) | 1 Oct 2021
- Constructions of Beyond-Birthday Secure PRFs from Random Permutations, RevisitedEntropy, Vol. 23, No. 10 | 30 September 2021
- Non-Interactive and Secure Data Aggregation Scheme for Internet of ThingsElectronics, Vol. 10, No. 20 | 11 October 2021
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verificationTheoretical Computer Science, Vol. 886 | 1 Sep 2021
- A rigorous and robust quantum speed-up in supervised machine learningNature Physics, Vol. 17, No. 9 | 12 July 2021
- Cryptographic models of nanocommunicaton network using quantum dot cellular automata: A surveyIET Quantum Communication, Vol. 2, No. 3 | 1 July 2021
- Private FLI: Anti-Gradient Leakage Recovery Data Privacy Architecture2021 International Joint Conference on Neural Networks (IJCNN) | 18 Jul 2021
- Fine-Grained Cryptography RevisitedJournal of Cryptology, Vol. 34, No. 3 | 24 May 2021
- Simple and fast derandomization from very hard functions: eliminating randomness at almost no costProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- PRISM: Private Verifiable Set Computation over Multi-Owner Outsourced DatabasesProceedings of the 2021 International Conference on Management of Data | 18 June 2021
- Traceable ring signatures: general framework and post-quantum securityDesigns, Codes and Cryptography, Vol. 89, No. 6 | 27 March 2021
- Towards Quantum One-Time Memories from Stateless HardwareQuantum, Vol. 5 | 8 April 2021
- Statistical Analysis of Prime Number Generators Putting Encryption at RiskAdvances in Security, Networks, and Internet of Things | 2 March 2021
- Single-to-Multi-theorem Transformations for Non-interactive Statistical Zero-KnowledgePublic-Key Cryptography – PKC 2021 | 1 May 2021
- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and ApplicationsAdvances in Cryptology – CRYPTO 2021 | 11 August 2021
- Simple Constructions from (Almost) Regular One-Way FunctionsTheory of Cryptography | 4 November 2021
- Secure remote state estimation against linear man-in-the-middle attacks using watermarkingAutomatica, Vol. 121 | 1 Nov 2020
- On One-way Functions and Kolmogorov Complexity2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- The complexity of human computation via a concrete model with an application to passwordsProceedings of the National Academy of Sciences, Vol. 117, No. 17 | 14 April 2020
- Implementing homomorphic encryption based secure feedback controlControl Engineering Practice, Vol. 97 | 1 Apr 2020
- Stream cipher designs: a reviewScience China Information Sciences, Vol. 63, No. 3 | 10 February 2020
- Introducing the pseudorandom value generator selection in the compilation toolchainProceedings of the 18th ACM/IEEE International Symposium on Code Generation and Optimization | 21 February 2020
- Efficient Error-Correcting Codes for Sliding WindowsSIAM Journal on Discrete Mathematics, Vol. 34, No. 1 | 24 March 2020
- Traceable Ring Signatures with Post-quantum SecurityTopics in Cryptology – CT-RSA 2020 | 14 February 2020
- Logic Locking of Boolean Circuits: Provable Hardware-Based Obfuscation from a Tamper-Proof MemoryInnovative Security Solutions for Information Technology and Communications | 28 February 2020
- Ker-I Ko and the Study of Resource-Bounded Kolmogorov ComplexityComplexity and Approximation | 21 February 2020
- Two Comments on Targeted Canonical DerandomizersComputational Complexity and Property Testing | 4 April 2020
- Randomness Tests: Theory and PracticeFields of Logic and Computation III | 23 May 2020
- Chosen-Ciphertext Secure Multi-identity and Multi-attribute Pure FHECryptology and Network Security | 9 December 2020
- Proving that prBPP = prP is as hard as proving that “almost NP” is not contained in P/polyInformation Processing Letters, Vol. 152 | 1 Dec 2019
- Provable Security of the Ma-Tsudik Forward-Secure Sequential Aggregate MAC Scheme2019 Seventh International Symposium on Computing and Networking Workshops (CANDARW) | 1 Nov 2019
- Mutual Relationship between the Neural Network Model and Linear Complexity for Pseudorandom Binary Number Sequence2019 Seventh International Symposium on Computing and Networking Workshops (CANDARW) | 1 Nov 2019
- Coherent-state quantum cryptography using pseudorandom number generatorsQuantum Electronics, Vol. 49, No. 10 | 1 Oct 2019
- True Random Number Generator (TRNG) Utilizing FM Radio Signals for Mobile and Embedded Devices in Multi-Access Edge ComputingSensors, Vol. 19, No. 19 | 24 September 2019
- Weak zero-knowledge beyond the black-box barrierProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 23 June 2019
- Pseudorandomness from ShrinkageJournal of the ACM, Vol. 66, No. 2 | 5 April 2019
- A Construction of a Keyword Search to Allow Partial Matching with a Block CipherInformation Security Applications | 12 April 2019
- Fine-Grained Cryptography RevisitedAdvances in Cryptology – ASIACRYPT 2019 | 22 November 2019
- Group-Oriented Cryptosystem for Personal Health Records Exchange and SharingIEEE Access, Vol. 7 | 1 Jan 2019
- Internet As a Source of RandomnessProceedings of the 17th ACM Workshop on Hot Topics in Networks | 15 November 2018
- Reducing costs in HSM-based data centersJournal of High Speed Networks, Vol. 24, No. 4 | 23 Oct 2018
- Practical State Recovery Attacks against Legacy RNG ImplementationsProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security | 15 October 2018
- Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2018
- An Average Case NP-complete Graph Colouring ProblemCombinatorics, Probability and Computing, Vol. 27, No. 5 | 2 April 2018
- An analysis on the revoking mechanisms for JSON Web TokensInternational Journal of Distributed Sensor Networks, Vol. 14, No. 9 | 21 September 2018
- On Constructing One-Way Permutations from Indistinguishability ObfuscationJournal of Cryptology, Vol. 31, No. 3 | 15 September 2017
- Asymptotically Efficient Lattice-Based Digital SignaturesJournal of Cryptology, Vol. 31, No. 3 | 30 October 2017
- An Algorithmic Method for Tampering-Proof and Privacy-Preserving Smart Metering2018 IEEE 16th International Conference on Industrial Informatics (INDIN) | 1 Jul 2018
- Quantified derandomization of linear threshold circuitsProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 20 June 2018
- Kolmogorov One-Way Functions RevisitedCryptography, Vol. 2, No. 2 | 28 April 2018
- True random bit generators based on current time series of contact glow discharge electrolysisJournal of Applied Physics, Vol. 123, No. 20 | 24 May 2018
- Polynomial Interpolation and Identity Testing from High Powers Over Finite FieldsAlgorithmica, Vol. 80, No. 2 | 5 January 2017
- Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?Theory of Cryptography | 4 November 2018
- One-Message Zero Knowledge and Non-malleable CommitmentsTheory of Cryptography | 4 November 2018
- Function Secret Sharing Using Fourier BasisAdvances in Network-Based Information Systems | 24 August 2017
- Pseudorandom Quantum StatesAdvances in Cryptology – CRYPTO 2018 | 24 July 2018
- TRNG (True Random Number Generator) Method Using Visible Spectrum for Secure Communication on 5G NetworkIEEE Access, Vol. 6 | 1 Jan 2018
- Practical and Secure Outsourcing of Discrete Log Group Exponentiation to a Single Malicious ServerProceedings of the 2017 on Cloud Computing Security Workshop | 3 November 2017
- Practical Secure Aggregation for Privacy-Preserving Machine LearningProceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security | 30 October 2017
- Preserving privacy using visual cryptography in surveillance systems2017 International Conference on Computer Science and Engineering (UBMK) | 1 Oct 2017
- One-Message Unilateral Entity Authentication SchemesProceedings of the 12th International Conference on Availability, Reliability and Security | 29 August 2017
- Dimension, pseudorandomness and extraction of pseudorandomness1Computability, Vol. 6, No. 3 | 7 Aug 2017
- Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size CircuitsACM Transactions on Computation Theory, Vol. 9, No. 2 | 27 April 2017
- Targeted pseudorandom generators, simulation advice generators, and derandomizing logspaceProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 19 June 2017
- New Pseudorandom Number Generators from Block Ciphers2017 IEEE Second International Conference on Data Science in Cyberspace (DSC) | 1 Jun 2017
- A succinct survey on (Pseudo)-random number generators from a cryptographic perspective2017 5th International Symposium on Digital Forensic and Security (ISDFS) | 1 Apr 2017
- Computationally-Sound ProofsLogic Colloquium '95 | 2 Mar 2017
- Fourier Concentration from Shrinkagecomputational complexity, Vol. 26, No. 1 | 12 May 2016
- Small-Bias is Not Enough to Hit Read-Once CNFTheory of Computing Systems, Vol. 60, No. 2 | 7 May 2016
- Quantum random number generatorsReviews of Modern Physics, Vol. 89, No. 1 | 22 February 2017
- Analyzing Protocol Security Through Information-Flow ControlDistributed Computing and Internet Technology | 26 November 2016
- Revisiting the Security Proof of QUAD Stream Cipher: Some Corrections and Tighter BoundsInformation Security and Cryptology | 3 March 2017
- A Note on Perfect Correctness by DerandomizationAdvances in Cryptology – EUROCRYPT 2017 | 1 April 2017
- Reducing Costs in HSM-Based Data CentersGreen, Pervasive, and Cloud Computing | 13 April 2017
- Bit Security of the Hyperelliptic Curves Diffie-Hellman ProblemProvable Security | 17 October 2017
- Security of Pseudo-Random Number Generators with InputInnovative Security Solutions for Information Technology and Communications | 29 October 2017
- A Secure Server-Based Pseudorandom Number Generator Protocol for Mobile DevicesInformation Security Practice and Experience | 8 December 2017
- Cryptographic Key Extraction from MusicAdvances in Computational Intelligence | 9 November 2016
- Stream Cipher DesignCryptographic Boolean Functions and Applications | 1 Jan 2017
- BibliographyCryptographic Boolean Functions and Applications | 1 Jan 2017
- Notice of Removal: New pseudorandom number generators from block ciphers2017 ISEA Asia Security and Privacy (ISEASP) | 1 Jan 2017
- When Can Limited Randomness Be Used in Repeated Games?Theory of Computing Systems, Vol. 59, No. 4 | 9 June 2016
- Cryptographic Hierarchical Access Control for Dynamic StructuresIEEE Transactions on Information Forensics and Security, Vol. 11, No. 10 | 1 Oct 2016
- A counterexample to the chain rule for conditional HILL entropycomputational complexity, Vol. 25, No. 3 | 16 March 2016
- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitmentscomputational complexity, Vol. 25, No. 3 | 19 April 2016
- Attacks on ownership transfer scheme for multi-tag multi-owner passive RFID environmentsComputer Communications, Vol. 88 | 1 Aug 2016
- Garbling XOR Gates “For Free” in the Standard ModelJournal of Cryptology, Vol. 29, No. 3 | 20 March 2015
- Novel pseudo-random number generator based on quantum random walksScientific Reports, Vol. 6, No. 1 | 4 February 2016
- Hierarchical and Shared Access ControlIEEE Transactions on Information Forensics and Security, Vol. 11, No. 4 | 1 Apr 2016
- Key evolving RFID systems: Forward/backward privacy and ownership transfer of RFID tagsAd Hoc Networks, Vol. 37 | 1 Feb 2016
- Pseudorandom generators against advised context-free languagesTheoretical Computer Science, Vol. 613 | 1 Feb 2016
- Learning Significant Fourier Coefficients over Finite Abelian GroupsEncyclopedia of Algorithms | 22 April 2016
- RankSynd a PRNG Based on Rank MetricPost-Quantum Cryptography | 4 February 2016
- Generic Construction of Audit Logging Schemes with Forward Privacy and AuthenticityInformation and Communications Security | 5 March 2016
- Bit Security of the CDH Problems over Finite FieldsSelected Areas in Cryptography – SAC 2015 | 1 Jan 2016
- The Security of Individual Bit for XTRInformation and Communications Security | 25 November 2016
- On Constructing One-Way Permutations from Indistinguishability ObfuscationTheory of Cryptography | 24 December 2015
- Contention in Cryptoland: Obfuscation, Leakage and UCETheory of Cryptography | 24 December 2015
- Towards Stream Ciphers for Efficient FHE with Low-Noise CiphertextsAdvances in Cryptology – EUROCRYPT 2016 | 28 April 2016
- Fine-Grained CryptographyAdvances in Cryptology – CRYPTO 2016 | 21 July 2016
- A Detailed View on SecureString 3.0Advances in Computing Applications | 20 January 2017
- ReferencesApplied Cryptography, Second Edition | 9 October 2015
- On the Complexity of Constructing Pseudorandom Functions (Especially when They Don’t Exist)Journal of Cryptology, Vol. 28, No. 3 | 13 November 2013
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational EntropyJournal of Cryptology, Vol. 28, No. 3 | 13 December 2013
- Pseudo-random sequence generator based on random selection of an elliptic curve2015 International Conference on Computer, Information and Telecommunication Systems (CITS) | 1 Jul 2015
- Mining Circuit Lower Bound Proofs for Meta-Algorithmscomputational complexity, Vol. 24, No. 2 | 21 April 2015
- Unifying Known Lower Bounds via Geometric Complexity Theorycomputational complexity, Vol. 24, No. 2 | 7 May 2015
- A Provable Watermark-Based Copyright Protection Scheme2015 10th Asia Joint Conference on Information Security | 1 May 2015
- Algorithmic rationality: Game theory with costly computationJournal of Economic Theory, Vol. 156 | 1 Mar 2015
- FPGA implementation of an elliptic curve based integrated system for encryption and authentication2015 IEEE International Conference on Signal Processing, Informatics, Communication and Energy Systems (SPICES) | 1 Feb 2015
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding CommitmentsSIAM Journal on Computing, Vol. 44, No. 1 | 26 February 2015
- RSA and Elliptic Curve Least Significant Bit SecurityProgress in Cryptology - LATINCRYPT 2014 | 29 March 2015
- The Chain Rule for HILL Pseudoentropy, RevisitedProgress in Cryptology -- LATINCRYPT 2015 | 15 August 2015
- Adaptive Witness Encryption and Asymmetric Password-Based CryptographyPublic-Key Cryptography -- PKC 2015 | 17 March 2015
- SPRING: Fast Pseudorandom Functions from Rounded Ring ProductsFast Software Encryption | 19 April 2015
- When Can Limited Randomness Be Used in Repeated Games?Algorithmic Game Theory | 10 December 2015
- Pseudorandom Bit Sequence Generator for Stream Cipher Based on Elliptic CurvesMathematical Problems in Engineering, Vol. 2015 | 1 Jan 2015
- Cryptographic Hash FunctionHandbook of Research on Threat Detection and Countermeasures in Network Security | 1 Jan 2015
- On linear-size pseudorandom generators and hardcore functionsTheoretical Computer Science, Vol. 554 | 1 Oct 2014
- Highly Efficient Linear Regression Outsourcing to a CloudIEEE Transactions on Cloud Computing, Vol. 2, No. 4 | 1 Oct 2014
- ComplexityWiley StatsRef: Statistics Reference Online | 29 September 2014
- Bit Security for Lucas-Based One-Way Function2014 Ninth Asia Joint Conference on Information Security | 1 Sep 2014
- Hierarchical and Shared Key Assignment2014 17th International Conference on Network-Based Information Systems | 1 Sep 2014
- Algorithms for Circuits and Circuits for Algorithms2014 IEEE 29th Conference on Computational Complexity (CCC) | 1 Jun 2014
- Mining Circuit Lower Bound Proofs for Meta-algorithms2014 IEEE 29th Conference on Computational Complexity (CCC) | 1 Jun 2014
- Fourier Concentration from Shrinkage2014 IEEE 29th Conference on Computational Complexity (CCC) | 1 Jun 2014
- On derandomizing algorithms that err extremely rarelyProceedings of the forty-sixth annual ACM symposium on Theory of computing | 31 May 2014
- Pseudorandom generators with optimal seed length for non-boolean poly-size circuitsProceedings of the forty-sixth annual ACM symposium on Theory of computing | 31 May 2014
- CryptographyComputing Handbook, Third Edition | 8 May 2014
- Turing and the development of computational complexityTuring's Legacy | 1 May 2014
- Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloudJournal of Parallel and Distributed Computing, Vol. 74, No. 3 | 1 Mar 2014
- Splittable pseudorandom number generators using cryptographic hashingACM SIGPLAN Notices, Vol. 48, No. 12 | 23 September 2013
- How to Garble Arithmetic CircuitsSIAM Journal on Computing, Vol. 43, No. 2 | 29 April 2014
- Overcoming Weak Expectations via the R$$\acute{e}$$nyi Entropy and the Expanded Computational EntropyInformation Theoretic Security | 23 January 2014
- A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point ArithmeticTheory and Applications of Models of Computation | 1 Jan 2014
- Forward-Secure Sequential Aggregate Message Authentication RevisitedProvable Security | 1 Jan 2014
- IntroductionCryptography in Constant Parallel Time | 1 Jan 2014
- Cryptography in NC 0Cryptography in Constant Parallel Time | 1 Jan 2014
- Cryptography with Constant Input LocalityCryptography in Constant Parallel Time | 1 Jan 2014
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor PermutationsTheory of Cryptography | 1 Jan 2014
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs ObfuscationAdvances in Cryptology – ASIACRYPT 2014 | 1 Jan 2014
- Computational ComplexityComputational Logic | 1 Jan 2014
- A PSEUDO-RANDOM NUMBER GENERATOR EMPLOYING MULTIPLE RÉNYI MAPSInternational Journal of Modern Physics C, Vol. 24, No. 11 | 14 October 2013
- Splittable pseudorandom number generators using cryptographic hashingProceedings of the 2013 ACM SIGPLAN symposium on Haskell | 23 September 2013
- Cryptographic Hash Function: A High Level View2013 International Conference on Informatics and Creative Multimedia | 1 Sep 2013
- Public Verifiable Key Encapsulation Mechanism under Factoring2013 5th International Conference on Intelligent Networking and Collaborative Systems | 1 Sep 2013
- Enhancements of Trapdoor PermutationsJournal of Cryptology, Vol. 26, No. 3 | 13 September 2012
- Quantum attacks on pseudorandom generatorsMathematical Structures in Computer Science, Vol. 23, No. 3 | 20 December 2012
- Guest columnACM SIGACT News, Vol. 44, No. 1 | 6 March 2013
- Efficient chosen ciphertext secure public‐key encryption under factoring assumptionSecurity and Communication Networks, Vol. 6, No. 3 | 21 June 2012
- Efficiency Improvements in Constructing Pseudorandom Generators from One-Way FunctionsSIAM Journal on Computing, Vol. 42, No. 3 | 25 June 2013
- The Blum-Blum-Shub Generator and Related CiphersStream Ciphers | 1 Jan 2013
- Sub-computable Bounded PseudorandomnessLogical Foundations of Computer Science | 1 Jan 2013
- Garbling XOR Gates “For Free” in the Standard ModelTheory of Cryptography | 1 Jan 2013
- On Linear-Size Pseudorandom Generators and Hardcore FunctionsComputing and Combinatorics | 1 Jan 2013
- Time/Memory/Data Tradeoffs for Variants of the RSA ProblemComputing and Combinatorics | 1 Jan 2013
- Robust Pseudorandom GeneratorsAutomata, Languages, and Programming | 1 Jan 2013
- Hard-Core Predicates for a Diffie-Hellman Problem over Finite FieldsAdvances in Cryptology – CRYPTO 2013 | 1 Jan 2013
- Translation-Randomizable Distributions via Random WalksProvable Security | 1 Jan 2013
- Recovering Private Keys Generated with Weak PRNGsCryptography and Coding | 1 Jan 2013
- Practical Chosen Ciphertext Secure Encryption from FactoringJournal of Cryptology, Vol. 26, No. 1 | 20 December 2011
- One-Way Functions Using Algorithmic and Classical Information TheoriesTheory of Computing Systems, Vol. 52, No. 1 | 25 July 2012
- Back MatterIT-Sicherheit | 1 Jan 2013
- Improving Classical Authentication over a Quantum ChannelEntropy, Vol. 14, No. 12 | 11 December 2012
- The Complexity of Explicit ConstructionsTheory of Computing Systems, Vol. 51, No. 3 | 18 November 2011
- 1 * N Trust Establishment within Dynamic Collaborative Clouds2012 IEEE International Conference on Cloud Computing in Emerging Markets (CCEM) | 1 Oct 2012
- Constructing a Pseudorandom Generator Requires an Almost Linear Number of Calls2012 IEEE 53rd Annual Symposium on Foundations of Computer Science | 1 Oct 2012
- Pseudorandomness from Shrinkage2012 IEEE 53rd Annual Symposium on Foundations of Computer Science | 1 Oct 2012
- Uniform derandomization from pathetic lower boundsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, Vol. 370, No. 1971 | 28 July 2012
- Computational Indistinguishability Between Quantum States and Its Cryptographic ApplicationJournal of Cryptology, Vol. 25, No. 3 | 12 April 2011
- Certifiable quantum diceProceedings of the forty-fourth annual ACM symposium on Theory of computing | 19 May 2012
- Pseudorandomness and derandomizationXRDS: Crossroads, The ACM Magazine for Students, Vol. 18, No. 3 | 1 March 2012
- On beating the hybrid argumentProceedings of the 3rd Innovations in Theoretical Computer Science Conference | 8 January 2012
- The Complexity of DistributionsSIAM Journal on Computing, Vol. 41, No. 1 | 2 February 2012
- Guarantee of Cryptographic Protocol SecurityCryptographic Protocol | 1 Jan 2012
- Plaintext-Checkable EncryptionTopics in Cryptology – CT-RSA 2012 | 1 Jan 2012
- Monte Carlo Methods Using New Class of Congruential GeneratorsICT Innovations 2011 | 1 Jan 2012
- A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational EntropyTheory of Cryptography | 1 Jan 2012
- Numerical Integration Using Sequences Generating PermutationsLarge-Scale Scientific Computing | 1 Jan 2012
- Public-Key Cryptography from New Multivariate Quadratic AssumptionsPublic Key Cryptography – PKC 2012 | 1 Jan 2012
- A 2-Dimensional Cellular Automata Pseudorandom Number Generator with Non-linear Neighborhood RelationshipNetworked Digital Technologies | 1 Jan 2012
- Improving the Performance of the SYND Stream CipherProgress in Cryptology - AFRICACRYPT 2012 | 1 Jan 2012
- Pseudorandom Generators Based on Subcovers for Finite GroupsInformation Security and Cryptology | 1 Jan 2012
- Key based bit level genetic cryptographic technique (KBGCT)2011 7th International Conference on Information Assurance and Security (IAS) | 1 Dec 2011
- Extracting and verifying cryptographic models from C protocol code by symbolic executionProceedings of the 18th ACM conference on Computer and communications security | 17 October 2011
- Low Cost RFID Authentication Protocol with Forward PrivacyChinese Journal of Computers, Vol. 34, No. 8 | 15 Oct 2011
- Immunity and pseudorandomness of context-free languagesTheoretical Computer Science, Vol. 412, No. 45 | 1 Oct 2011
- How to Garble Arithmetic Circuits2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- Pseudorandomness for Read-Once Formulas2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- The Randomness Complexity of Parallel Repetition2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 1 Oct 2011
- Paillier’s trapdoor function hides Θ(n) bitsScience China Information Sciences, Vol. 54, No. 9 | 17 June 2011
- The Dynamic key and implementation of Rijndael algorithm2011 International Conference on Multimedia Technology | 1 Jul 2011
- S-T connectivity on digraphs with a known stationary distributionACM Transactions on Algorithms, Vol. 7, No. 3 | 15 July 2011
- Pseudorandomness for Permutation and Regular Branching Programs2011 IEEE 26th Annual Conference on Computational Complexity | 1 Jun 2011
- Wavelet-based image watermarking with visibility range estimation based on HVS and neural networksPattern Recognition, Vol. 44, No. 4 | 1 Apr 2011
- The quest for randomnessCommunications of the ACM, Vol. 54, No. 4 | 1 April 2011
- Patterns hidden from simple algorithmsCommunications of the ACM, Vol. 54, No. 4 | 1 April 2011
- Weak Derandomization of Weak Algorithms: Explicit Versions of Yao’s Lemmacomputational complexity, Vol. 20, No. 1 | 19 April 2011
- Lossy Trapdoor Functions and Their ApplicationsSIAM Journal on Computing, Vol. 40, No. 6 | 22 December 2011
- OAEP: Optimal Asymmetric Encryption PaddingEncyclopedia of Cryptography and Security | 1 Jan 2011
- Entropy SourcesEncyclopedia of Cryptography and Security | 1 Jan 2011
- Hard-Core BitEncyclopedia of Cryptography and Security | 1 Jan 2011
- Towards Non-Black-Box Lower Bounds in CryptographyTheory of Cryptography | 1 Jan 2011
- On Black-Box Separations among Injective One-Way FunctionsTheory of Cryptography | 1 Jan 2011
- In a World of P=BPPStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- Three XOR-Lemmas — An ExpositionStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- On Constructing 1-1 One-Way FunctionsStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- Randomness and ComputationStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- On Security Preserving Reductions – Revised TerminologyStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- Another Motivation for Reducing the Randomness Complexity of AlgorithmsStudies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 1 Jan 2011
- 2SC: An Efficient Code-Based Stream CipherInformation Security and Assurance | 1 Jan 2011
- Non-interactive Opening for Ciphertexts Encrypted by Shared KeysInformation and Communications Security | 1 Jan 2011
- Cryptography Secure against Related-Key Attacks and TamperingAdvances in Cryptology – ASIACRYPT 2011 | 1 Jan 2011
- Universally Composable Symbolic Security AnalysisJournal of Cryptology, Vol. 24, No. 1 | 9 March 2010
- Sequential Bitwise Sanitizable Signature SchemesIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E94-A, No. 1 | 1 Jan 2011
- An Efficient Noise Generator for Validation of Channels EqualizersJournal of Signal and Information Processing, Vol. 02, No. 01 | 1 Jan 2011
- The Complexity of Distributions2010 IEEE 51st Annual Symposium on Foundations of Computer Science | 1 Oct 2010
- The Bit Security of Two Variants of Paillier Trapdoor FunctionChinese Journal of Computers, Vol. 33, No. 6 | 1 Jul 2010
- Typically-correct derandomizationACM SIGACT News, Vol. 41, No. 2 | 9 June 2010
- Simple Affine Extractors Using Dimension Expansion2010 IEEE 25th Annual Conference on Computational Complexity | 1 Jun 2010
- On the Power of Randomized Reductions and the Checkability of SAT2010 IEEE 25th Annual Conference on Computational Complexity | 1 Jun 2010
- A new method for generating cryptographically strong sequences of pseudo random bits for stream cipherInternational Conference on Computer and Communication Engineering (ICCCE'10) | 1 May 2010
- More efficient DDH pseudorandom generatorsDesigns, Codes and Cryptography, Vol. 55, No. 1 | 30 September 2009
- Correlation Estimating Algorithm of XML Stream Based on Hamming NormsJournal of Software, Vol. 21, No. 4 | 11 Mar 2010
- Simple extractors via constructions of cryptographic pseudo-random generatorsTheoretical Computer Science, Vol. 411, No. 10 | 1 Mar 2010
- Bounds on the efficiency of black-box commitment schemesTheoretical Computer Science, Vol. 411, No. 10 | 1 Mar 2010
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List DecodingSIAM Journal on Computing, Vol. 39, No. 7 | 5 May 2010
- On the Implementation of Huge Random ObjectsSIAM Journal on Computing, Vol. 39, No. 7 | 5 May 2010
- On Related-Secret PseudorandomnessTheory of Cryptography | 1 Jan 2010
- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening AttacksAdvances in Cryptology – EUROCRYPT 2010 | 1 Jan 2010
- Adaptive Trapdoor Functions and Chosen-Ciphertext SecurityAdvances in Cryptology – EUROCRYPT 2010 | 1 Jan 2010
- The Complexity of Explicit ConstructionsPrograms, Proofs, Processes | 1 Jan 2010
- Pseudorandomness In Computer Science and In Additive CombinatoricsAn Irregular Mind | 1 Jan 2010
- Leakage Resilient Cryptography in PracticeTowards Hardware-Intrinsic Security | 12 October 2010
- Protocols for Multiparty Coin Toss with Dishonest MajorityAdvances in Cryptology – CRYPTO 2010 | 1 Jan 2010
- Provably Secure Higher-Order Masking of AESCryptographic Hardware and Embedded Systems, CHES 2010 | 1 Jan 2010
- Uniform Derandomization from Pathetic Lower BoundsApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2010
- Generic Complexity of Presburger ArithmeticTheory of Computing Systems, Vol. 46, No. 1 | 28 May 2008
- MV-OPES: Multivalued-Order Preserving Encryption Scheme: A Novel Scheme for Encrypting Integer Value to Many Different ValuesIEICE Transactions on Information and Systems, Vol. E93-D, No. 9 | 1 Jan 2010
- Mapping the discrete logarithmInvolve, a Journal of Mathematics, Vol. 3, No. 2 | 11 August 2010
- QUAD: A multivariate stream cipher with provable securityJournal of Symbolic Computation, Vol. 44, No. 12 | 1 Dec 2009
- Impact of machine learning algorithms on analysis of stream ciphers2009 Proceeding of International Conference on Methods and Models in Computer Science (ICM2CS) | 1 Dec 2009
- Cryptography with Constant Input LocalityJournal of Cryptology, Vol. 22, No. 4 | 11 April 2009
- A Critical Review of Receipt-Freeness and Coercion-ResistanceInformation Technology Journal, Vol. 8, No. 7 | 15 Sep 2009
- Reconstructive Dispersers and Hitting Set GeneratorsAlgorithmica, Vol. 55, No. 1 | 19 December 2008
- Reducing Complexity Assumptions for Statistically-Hiding CommitmentJournal of Cryptology, Vol. 22, No. 3 | 22 September 2007
- A New Class of Pseudo-random Functions2009 Asia-Pacific Conference on Information Processing | 1 Jul 2009
- Fixed-Polynomial Size Circuit Bounds2009 24th Annual IEEE Conference on Computational Complexity | 1 Jul 2009
- Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma2009 24th Annual IEEE Conference on Computational Complexity | 1 Jul 2009
- Are PCPs Inherent in Efficient Arguments?2009 24th Annual IEEE Conference on Computational Complexity | 1 Jul 2009
- Pseudo-random number generation applied to robust modern cryptography: A new technique for block ciphers2009 15th IEEE International On-Line Testing Symposium | 1 Jun 2009
- Design, implementation and analysis of hardware efficient stream ciphers using LFSR based hash functionsComputers & Security, Vol. 28, No. 3-4 | 1 May 2009
- A Random Oracle Model for Information Hiding Resisting Extracting2009 International Conference on E-Business and Information System Security | 1 May 2009
- Implementation and analysis of stream ciphers based on the elliptic curvesComputers & Electrical Engineering, Vol. 35, No. 2 | 1 Mar 2009
- Polylogarithmic Independence Can Fool DNF FormulasSIAM Journal on Computing, Vol. 38, No. 6 | 4 March 2009
- Low-End Uniform Hardness versus Randomness Tradeoffs for AMSIAM Journal on Computing, Vol. 39, No. 3 | 2 September 2009
- Simultaneous Hardcore Bits and Cryptography against Memory AttacksTheory of Cryptography | 1 Jan 2009
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE TransformationsTopics in Cryptology – CT-RSA 2009 | 1 Jan 2009
- Practical Chosen Ciphertext Secure Encryption from FactoringAdvances in Cryptology - EUROCRYPT 2009 | 1 Jan 2009
- Extractors Using Hardness AmplificationApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2009
- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?Advances in Cryptology – ASIACRYPT 2009 | 1 Jan 2009
- General Pseudo-random Generators from Weaker Models of ComputationAlgorithms and Computation | 1 Jan 2009
- ReferencesCryptographic Boolean Functions and Applications | 1 Jan 2009
- New stream ciphers based on elliptic curve point multiplicationComputer Communications, Vol. 32, No. 1 | 1 Jan 2009
- Optimal Communication Complexity of Generic Multicast Key DistributionIEEE/ACM Transactions on Networking, Vol. 16, No. 4 | 1 Aug 2008
- Wavelet based image watermarking using rank order and genetic algorithmThe Imaging Science Journal, Vol. 56, No. 4 | 18 July 2013
- Cryptography with constant computational overheadProceedings of the fortieth annual ACM symposium on Theory of computing | 17 May 2008
- A New Method of Isolation of Isoflavones from Glycine max (Soya Beans) by Complexation TechniqueAsian Journal of Scientific Research, Vol. 1, No. 2 | 15 Feb 2008
- Learning Significant Fourier Coefficients over Finite Abelian GroupsEncyclopedia of Algorithms | 1 Jan 2008
- Asymptotically Efficient Lattice-Based Digital SignaturesTheory of Cryptography | 1 Jan 2008
- Deterministic Encryption: Definitional Equivalences and Constructions without Random OraclesAdvances in Cryptology – CRYPTO 2008 | 1 Jan 2008
- The Complexity of Local List DecodingApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2008
- Limitations of Hardness vs. Randomness under Uniform ReductionsApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2008
- A New Attack on the LEX Stream CipherAdvances in Cryptology - ASIACRYPT 2008 | 1 Jan 2008
- Note bibliograficheAlgoritmi | 1 Jan 2008
- Practical Construction and Analysis of Pseudo-Randomness PrimitivesJournal of Cryptology, Vol. 21, No. 1 | 15 September 2007
- The reactive simulatability (RSIM) framework for asynchronous systemsInformation and Computation, Vol. 205, No. 12 | 1 Dec 2007
- International Conference on Computational Intelligence and Multimedia Applications - TitleInternational Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007) | 1 Dec 2007
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing SecurityIEEE Transactions on Information Theory, Vol. 53, No. 11 | 1 Nov 2007
- Polylogarithmic Independence Can Fool DNF Formulas48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) | 1 Oct 2007
- Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) | 1 Oct 2007
- The unified theory of pseudorandomnessACM SIGACT News, Vol. 38, No. 3 | 1 September 2007
- Low-end uniform hardness vs. randomness tradeoffs for AMProceedings of the thirty-ninth annual ACM symposium on Theory of computing | 11 June 2007
- On Pseudorandomness in Families of Sequences Derived from the Legendre SymbolPeriodica Mathematica Hungarica, Vol. 54, No. 2 | 25 February 2017
- On Derandomizing Probabilistic Sublinear-Time AlgorithmsTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) | 1 Jun 2007
- S-T Connectivity on Digraphs with a Known Stationary DistributionTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) | 1 Jun 2007
- SYND: a Fast Code-Based Stream Cipher with a Security Reduction2007 IEEE International Symposium on Information Theory | 1 Jun 2007
- Overview of Cryptographic Primitives for Secure CommunicationWireless Security and Cryptography | 11 January 2010
- Compact FPGA implementations of QUADProceedings of the 2nd ACM symposium on Information, computer and communications security | 20 March 2007
- Derandomization in CryptographySIAM Journal on Computing, Vol. 37, No. 2 | 16 May 2007
- Zaps and Their ApplicationsSIAM Journal on Computing, Vol. 36, No. 6 | 9 February 2007
- Efficient Pseudorandom Generators Based on the DDH AssumptionPublic Key Cryptography – PKC 2007 | 1 Jan 2007
- Decision-Based Hybrid Image Watermarking in Wavelet Domain Using HVS and Neural NetworksAdvances in Neural Networks – ISNN 2007 | 1 Jan 2007
- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number GeneratorAdvances in Cryptology - CRYPTO 2007 | 1 Jan 2007
- A Generalization of DDH with Applications to Protocol Analysis and Computational SoundnessAdvances in Cryptology - CRYPTO 2007 | 1 Jan 2007
- Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational ArgumentMathematical Foundations of Computer Science 2007 | 1 Jan 2007
- Generic Complexity of Presburger ArithmeticComputer Science – Theory and Applications | 1 Jan 2007
- On the Security of IV Dependent Stream CiphersFast Software Encryption | 1 Jan 2007
- Back MatterIT-Sicherheit | 1 Jan 2007
- Reducing Complexity Assumptions for Statistically-Hiding Commitment*SSRN Electronic Journal, Vol. 7 | 1 Jan 2007
- Performance improvement for the GGM-construction of pseudorandom functionsApplied Mathematics and Computation, Vol. 183, No. 1 | 1 Dec 2006
- Can every randomized algorithm be derandomized?Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 21 May 2006
- On basing one-way functions on NP-hardnessProceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 21 May 2006
- On the randomness complexity of efficient samplingProceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 21 May 2006
- Logics for reasoning about cryptographic constructionsJournal of Computer and System Sciences, Vol. 72, No. 2 | 1 Mar 2006
- Randomness in cryptographyIEEE Security & Privacy Magazine, Vol. 4, No. 2 | 1 Mar 2006
- How to fool an unbounded adversary with a short keyIEEE Transactions on Information Theory, Vol. 52, No. 3 | 1 Mar 2006
- Power from Random StringsSIAM Journal on Computing, Vol. 35, No. 6 | 27 July 2006
- Quantum Algorithms for Some Hidden Shift ProblemsSIAM Journal on Computing, Vol. 36, No. 3 | 24 October 2006
- Properties of NP‐Complete SetsSIAM Journal on Computing, Vol. 36, No. 2 | 31 July 2006
- Cryptography in $NC^0$SIAM Journal on Computing, Vol. 36, No. 4 | 15 December 2006
- Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange ProtocolsTheory of Cryptography | 1 Jan 2006
- Pseudorandom Generators from One-Way Functions: A Simple Construction for Any HardnessTheory of Cryptography | 1 Jan 2006
- QUAD: A Practical Stream Cipher with Provable SecurityAdvances in Cryptology - EUROCRYPT 2006 | 1 Jan 2006
- Distinguishing Attacks on the Stream Cipher PyFast Software Encryption | 1 Jan 2006
- On Pseudorandom Generators with Linear Stretch in NC0 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2006
- On Pseudorandom Sequences and Their ApplicationGeneral Theory of Information Transfer and Combinatorics | 1 Jan 2006
- On the Provable Security of an Efficient RSA-Based Pseudorandom GeneratorAdvances in Cryptology – ASIACRYPT 2006 | 1 Jan 2006
- Another Look at “Provable Security”. IIProgress in Cryptology - INDOCRYPT 2006 | 1 Jan 2006
- Some Results on Average-Case Hardness Within the Polynomial HierarchyFSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 1 Jan 2006
- Quantum Computational CryptographyQuantum Computation and Information | 1 Jan 2006
- Probabilistische AlgorithmenAlgorithmik | 1 Jan 2006
- How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract)Advances in Cryptology — CRYPTO’ 86 | 1 Jan 2006
- Towards a Theory of Software Protection (Extended Abstract)Advances in Cryptology — CRYPTO’ 86 | 1 Jan 2006
- Exposure-Resilient Extractors21st Annual IEEE Conference on Computational Complexity (CCC'06) | 1 Jan 2006
- Making Hard Problems Harder21st Annual IEEE Conference on Computational Complexity (CCC'06) | 1 Jan 2006
- Ultra-Efficient (Embedded) SOC Architectures based on Probabilistic CMOS (PCMOS) TechnologyProceedings of the Design Automation & Test in Europe Conference | 1 Jan 2006
- Anti-Tamper Databases: Processing Aggregate Queries over Encrypted Databases22nd International Conference on Data Engineering Workshops (ICDEW'06) | 1 Jan 2006
- Robust Watermarking in Wavelet Domain Using Rank Order and Genetic Algorithm for Image AuthorizationThe 2006 IEEE International Joint Conference on Neural Network Proceedings | 1 Jan 2006
- ComplexityEncyclopedia of Statistical Sciences | 15 August 2006
- NONDETERMINISTIC CIRCUIT MINIMIZATION PROBLEM AND DERANDOMIZING ARTHUR-MERLIN GAMESInternational Journal of Foundations of Computer Science, Vol. 16, No. 06 | 20 November 2011
- Efficient and provably secure ciphers for storage device block level encryptionProceedings of the 2005 ACM workshop on Storage security and survivability | 11 November 2005
- A model and architecture for pseudo-random generation with applications to /dev/randomProceedings of the 12th ACM conference on Computer and communications security | 7 November 2005
- Universal test for quantum one-way permutationsTheoretical Computer Science, Vol. 345, No. 2-3 | 1 Nov 2005
- Disk drive generates high speed real random numbersMicrosystem Technologies, Vol. 11, No. 8-10 | 14 July 2005
- Secure Implementation of Message Digest, Authentication and Digital SignatureInformation Technology Journal, Vol. 4, No. 3 | 15 Jun 2005
- On obfuscating point functionsProceedings of the thirty-seventh annual ACM symposium on Theory of computing | 22 May 2005
- Simple extractors for all min-entropies and a new pseudorandom generatorJournal of the ACM, Vol. 52, No. 2 | 1 March 2005
- Holographic Proofs and DerandomizationSIAM Journal on Computing, Vol. 35, No. 1 | 27 July 2006
- Bounds on the Efficiency of Generic Cryptographic ConstructionsSIAM Journal on Computing, Vol. 35, No. 1 | 27 July 2006
- Computational Indistinguishability Between Quantum States and Its Cryptographic ApplicationAdvances in Cryptology – EUROCRYPT 2005 | 1 Jan 2005
- Reducing Complexity Assumptions for Statistically-Hiding CommitmentAdvances in Cryptology – EUROCRYPT 2005 | 1 Jan 2005
- Simple Extractors via Constructions of Cryptographic Pseudo-random GeneratorsAutomata, Languages and Programming | 1 Jan 2005
- Bounds on the Efficiency of “Black-Box” Commitment SchemesAutomata, Languages and Programming | 1 Jan 2005
- Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical SchemesAdvances in Cryptology – CRYPTO 2005 | 1 Jan 2005
- Can Dynamic Neural Filters Produce Pseudo-Random Sequences?Artificial Neural Networks: Biological Inspirations – ICANN 2005 | 1 Jan 2005
- Computational Complexity Since 1980FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 1 Jan 2005
- Proving Lower Bounds Via Pseudo-random GeneratorsFSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 1 Jan 2005
- Foundations of Modern CryptographyContemporary Cryptology | 1 Jan 2005
- Hard Bits of the Discrete Log with Applications to Password AuthenticationTopics in Cryptology – CT-RSA 2005 | 1 Jan 2005
- On Constructing Parallel Pseudorandom Generators from One-Way Functions20th Annual IEEE Conference on Computational Complexity (CCC'05) | 1 Jan 2005
- On the Complexity of Hardness Amplification20th Annual IEEE Conference on Computational Complexity (CCC'05) | 1 Jan 2005
- Pseudorandomness for Approximate Counting and Sampling20th Annual IEEE Conference on Computational Complexity (CCC'05) | 1 Jan 2005
- Computationally Private Randomizing Polynomials and Their Applications20th Annual IEEE Conference on Computational Complexity (CCC'05) | 1 Jan 2005
- A List-Decodable Code with Local Encoding and DecodingSixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks (SNPD/SAWN'05) | 1 Jan 2005
- Distribution of the error in estimated numbers of fixed points of the discrete logarithmACM SIGSAM Bulletin, Vol. 38, No. 4 | 1 December 2004
- Randomness and Probability—Complexity of DescriptionEncyclopedia of Statistical Sciences | 15 October 2004
- The random oracle methodology, revisitedJournal of the ACM, Vol. 51, No. 4 | 1 July 2004
- Number-theoretic constructions of efficient pseudo-random functionsJournal of the ACM, Vol. 51, No. 2 | 1 March 2004
- Anti-Tamper DatabasesData and Applications Security XVII | 1 Jan 2004
- New Results on the Hardness of Diffie-Hellman BitsPublic Key Cryptography – PKC 2004 | 1 Jan 2004
- Short Exponent Diffie-Hellman ProblemsPublic Key Cryptography – PKC 2004 | 1 Jan 2004
- What Do Random Polynomials over Finite Fields Look Like?Finite Fields and Applications | 1 Jan 2004
- Notions of Reducibility between Cryptographic PrimitivesTheory of Cryptography | 1 Jan 2004
- Physically Observable CryptographyTheory of Cryptography | 1 Jan 2004
- Single Database Private Information Retrieval with Logarithmic CommunicationInformation Security and Privacy | 1 Jan 2004
- A Hybrid Protocol for Quantum Authentication of Classical MessagesTelecommunications and Networking - ICT 2004 | 1 Jan 2004
- Complete Classification of Bilinear Hard-Core FunctionsAdvances in Cryptology – CRYPTO 2004 | 1 Jan 2004
- Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?Advances in Cryptology – CRYPTO 2004 | 1 Jan 2004
- Universal Test for Quantum One-Way PermutationsMathematical Foundations of Computer Science 2004 | 1 Jan 2004
- On the Role Definitions in and Beyond CryptographyAdvances in Computer Science - ASIAN 2004. Higher-Level Decision Making | 1 Jan 2004
- Right-Invariance: A Property for Probabilistic Analysis of Cryptography Based on Infinite GroupsAdvances in Cryptology - ASIACRYPT 2004 | 1 Jan 2004
- BibliographyComputational Complexity: A Quantitative Perspective | 1 Jan 2004
- A random number generator based on elliptic curve operationsComputers & Mathematics with Applications, Vol. 47, No. 2-3 | 1 Jan 2004
- BibliographyStream Ciphers and Number Theory | 1 Jan 2004
- Properties of NP-complete setsProceedings. 19th IEEE Annual Conference on Computational Complexity, 2004. | 1 Jan 2004
- A Look Back at "Security Problems in the TCP/IP Protocol Suite"20th Annual Computer Security Applications Conference | 1 Jan 2004
- Cryptography in NC⁰45th Annual IEEE Symposium on Foundations of Computer Science | 1 Jan 2004
- Pseudo-random generators for all hardnessesJournal of Computer and System Sciences, Vol. 67, No. 2 | 1 Sep 2003
- Deterministic approximation of the cover timeRandom Structures & Algorithms, Vol. 23, No. 1 | 9 May 2003
- Lower bounds on the efficiency of encryption and digital signature schemesProceedings of the thirty-fifth annual ACM symposium on Theory of computing | 9 June 2003
- Amortizing Randomness in Private Multiparty ComputationsSIAM Journal on Discrete Mathematics, Vol. 16, No. 4 | 1 August 2006
- Randomness Re-use in Multi-recipient Encryption SchemeasPublic Key Cryptography — PKC 2003 | 18 December 2002
- Evaluation Criteria for True (Physical) Random Number Generators Used in Cryptographic ApplicationsCryptographic Hardware and Embedded Systems - CHES 2002 | 17 February 2003
- An Improved Pseudorandom Generator Based on Hardness of FactoringSecurity in Communication Networks | 14 March 2003
- Forward-Security in Private-Key CryptographyTopics in Cryptology — CT-RSA 2003 | 28 February 2003
- Nearly One-Sided Tests and the Goldreich-Levin PredicateAdvances in Cryptology — EUROCRYPT 2003 | 13 May 2003
- The Security of ”One-Block-to-Many” Modes of OperationFast Software Encryption | 1 Jan 2003
- Derandomization in CryptographyAdvances in Cryptology - CRYPTO 2003 | 1 Jan 2003
- Computational Analogues of EntropyApproximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 1 Jan 2003
- Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. | 1 Jan 2003
- Hardness vs. randomness within alternating time18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. | 1 Jan 2003
- Holographic proofs and derandomization18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. | 1 Jan 2003
- On the implementation of huge random objects44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. | 1 Jan 2003
- Zero-knowledge sets44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. | 1 Jan 2003
- On the (In)security of the Fiat-Shamir paradigm44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. | 1 Jan 2003
- Proving hard-core predicates using list decoding44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. | 1 Jan 2003
- Pseudo-random generators for all hardnessesProceedings of the thiry-fourth annual ACM symposium on Theory of computing | 19 May 2002
- A comparison of two approaches to pseudorandomnessTheoretical Computer Science, Vol. 276, No. 1-2 | 1 Apr 2002
- Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy CollapsesSIAM Journal on Computing, Vol. 31, No. 5 | 17 February 2012
- Pseudorandom Functions and FactoringSIAM Journal on Computing, Vol. 31, No. 5 | 17 February 2012
- The Hardness of Hensel Lifting: The Case of RSA and Discrete LogarithmAdvances in Cryptology — ASIACRYPT 2002 | 8 November 2002
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature SchemesAdvances in Cryptology — ASIACRYPT 2002 | 8 November 2002
- Distributed Algorithm EngineeringExperimental Algorithmics | 16 December 2002
- Fixed Points and Two-Cycles of the Discrete LogarithmAlgorithmic Number Theory | 21 June 2002
- On Sufficient Randomness for Secure Public-Key CryptosystemsPublic Key Cryptography | 5 February 2002
- Hidden Number Problem with the Trace and Bit Security of XTR and LUCAdvances in Cryptology — CRYPTO 2002 | 13 September 2002
- Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext SecurityAdvances in Cryptology — CRYPTO 2002 | 13 September 2002
- Unique Signatures and Verifiable Random Functions from the DH-DDH SeparationAdvances in Cryptology — CRYPTO 2002 | 13 September 2002
- Randomness-Optimal Characterization of Two NP Proof SystemsRandomization and Approximation Techniques in Computer Science | 23 August 2002
- Derandomization That Is Rarely Wrong from Short Advice That Is Typically GoodRandomization and Approximation Techniques in Computer Science | 23 August 2002
- A Quantum Goldreich-Levin Theorem with Cryptographic ApplicationsSTACS 2002 | 21 February 2002
- The Hidden Number Problem in Extension Fields and Its ApplicationsLATIN 2002: Theoretical Informatics | 14 March 2002
- A Practice-Oriented Treatment of Pseudorandom Number GeneratorsAdvances in Cryptology — EUROCRYPT 2002 | 29 April 2002
- Efficient Generic Forward-Secure Signatures with an Unbounded Number of Time PeriodsAdvances in Cryptology — EUROCRYPT 2002 | 29 April 2002
- Indistinguishability of Random SystemsAdvances in Cryptology — EUROCRYPT 2002 | 29 April 2002
- How to Fool an Unbounded Adversary with a Short KeyAdvances in Cryptology — EUROCRYPT 2002 | 29 April 2002
- Pseudo-random generators and structure of complete degreesProceedings 17th IEEE Annual Conference on Computational Complexity | 1 Jan 2002
- HySOR: group key management with collusion-scalability tradeoffs using a hybrid structuring of receiversProceedings. Eleventh International Conference on Computer Communications and Networks | 1 Jan 2002
- Generalized indistinguishabilityProceedings IEEE International Symposium on Information Theory, | 1 Jan 2002
- Power from random stringsThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. | 1 Jan 2002
- Randomness vs Time: Derandomization under a Uniform AssumptionJournal of Computer and System Sciences, Vol. 63, No. 4 | 1 Dec 2001
- Paillier's cryptosystem revisitedProceedings of the 8th ACM conference on Computer and Communications Security | 5 November 2001
- Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductionsTheoretical Computer Science, Vol. 268, No. 2 | 1 Oct 2001
- Secure and efficient key management for dynamic multicast groupsACM SIGOPS Operating Systems Review, Vol. 35, No. 4 | 1 October 2001
- Extractors and pseudorandom generatorsJournal of the ACM, Vol. 48, No. 4 | 1 July 2001
- Pseudorandom Generators without the XOR LemmaJournal of Computer and System Sciences, Vol. 62, No. 2 | 1 Mar 2001
- Cryptography 2000±10Informatics | 29 March 2001
- A New Aspect for Security Notions: Secure Randomness in Public-Key Encryption SchemesPublic Key Cryptography | 5 June 2001
- Universally Composable CommitmentsAdvances in Cryptology — CRYPTO 2001 | 2 August 2001
- Session-Key Generation Using Human Passwords OnlyAdvances in Cryptology — CRYPTO 2001 | 2 August 2001
- Pseudorandomness from Braid GroupsAdvances in Cryptology — CRYPTO 2001 | 2 August 2001
- On Pseudorandom Generators in NC0Mathematical Foundations of Computer Science 2001 | 5 September 2001
- Pseudo-random Number Generation on the IBM 4758 Secure Crypto CoprocessorCryptographic Hardware and Embedded Systems — CHES 2001 | 20 September 2001
- The Bit Security of Paillier’s Encryption Scheme and Its ApplicationsAdvances in Cryptology — EUROCRYPT 2001 | 15 April 2001
- Hard Sets and Pseudo-random Generators for Constant Depth CircuitsFST TCS 2001: Foundations of Software Technology and Theoretical Computer Science | 26 November 2001
- Mutually Independent CommitmentsAdvances in Cryptology — ASIACRYPT 2001 | 20 November 2001
- Practical Construction and Analysis of Pseudo-Randomness PrimitivesAdvances in Cryptology — ASIACRYPT 2001 | 20 November 2001
- The Modular Inversion Hidden Number ProblemAdvances in Cryptology — ASIACRYPT 2001 | 20 November 2001
- A Survey of Hard Core FunctionsCryptography and Computational Number Theory | 1 Jan 2001
- Simple extractors for all min-entropies and a new pseudo-random generatorProceedings 42nd IEEE Symposium on Foundations of Computer Science | 1 Jan 2001
- Improved Algorithms via Approximations of Probability DistributionsJournal of Computer and System Sciences, Vol. 61, No. 1 | 1 Aug 2000
- Protecting Data Privacy in Private Information Retrieval SchemesJournal of Computer and System Sciences, Vol. 60, No. 3 | 1 Jun 2000
- Extractors and pseudo-random generators with optimal seed lengthProceedings of the thirty-second annual ACM symposium on Theory of computing | 1 May 2000
- Pseudo-random functions and factoring (extended abstract)Proceedings of the thirty-second annual ACM symposium on Theory of computing | 1 May 2000
- Xor-trees for efficient anonymous multicast and receptionACM Transactions on Information and System Security, Vol. 3, No. 2 | 1 May 2000
- Resource bounded randomness and computational complexityTheoretical Computer Science, Vol. 237, No. 1-2 | 1 Apr 2000
- Computational Sample Complexity and Attribute-Efficient LearningJournal of Computer and System Sciences, Vol. 60, No. 1 | 1 Feb 2000
- Computational Sample ComplexitySIAM Journal on Computing, Vol. 29, No. 3 | 27 July 2006
- A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP ProblemSIAM Journal on Computing, Vol. 30, No. 2 | 27 July 2006
- Derandomizing Arthur-Merlin Games under Uniform AssumptionsAlgorithms and Computation | 29 January 2002
- Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying TechniquesAdvances in Cryptology — ASIACRYPT 2000 | 27 October 2000
- An Improved Pseudo-random Generator Based on Discrete LogAdvances in Cryptology — CRYPTO 2000 | 11 August 2000
- List Decoding: Algorithms and ApplicationsTheoretical Computer Science: Exploring New Frontiers of Theoretical Informatics | 24 August 2001
- Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP RelationsAutomata, Languages and Programming | 18 February 2002
- PseudorandomnessAutomata, Languages and Programming | 18 February 2002
- Elliptic Curve Pseudorandom Sequence GeneratorsSelected Areas in Cryptography | 27 July 2001
- Zaps and their applicationsProceedings 41st Annual Symposium on Foundations of Computer Science | 1 Jan 2000
- Lower bounds on the efficiency of generic cryptographic constructionsProceedings 41st Annual Symposium on Foundations of Computer Science | 1 Jan 2000
- Linear complexity of the orbitsInformation Processing Letters, Vol. 72, No. 1-2 | 1 Oct 1999
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offsTheoretical Computer Science, Vol. 221, No. 1-2 | 1 Jun 1999
- Construction of extractors using pseudo-random generators (extended abstract)Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Security-preserving hardness-amplification for any regular one-way functionProceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Chinese remaindering with errorsProceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Pseudorandom generators without the XOR Lemma (extended abstract)Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapsesProceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Computational sample complexity and attribute-efficient learningProceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Hardness and hierarchy theorems for probabilistic quasi-polynomial timeProceedings of the thirty-first annual ACM symposium on Theory of Computing | 1 May 1999
- Synthesizers and Their Application to the Parallel Construction of Pseudo-Random FunctionsJournal of Computer and System Sciences, Vol. 58, No. 2 | 1 Apr 1999
- Multiple NonInteractive Zero Knowledge Proofs Under General AssumptionsSIAM Journal on Computing, Vol. 29, No. 1 | 27 July 2006
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, Vol. 28, No. 4 | 28 July 2006
- On the Robustness of Functional EquationsSIAM Journal on Computing, Vol. 28, No. 6 | 28 July 2006
- Weak Random Sources, Hitting Sets, and BPP SimulationsSIAM Journal on Computing, Vol. 28, No. 6 | 28 July 2006
- Compressing Cryptographic ResourcesAdvances in Cryptology — CRYPTO’ 99 | 16 December 1999
- High-Speed Pseudorandom Number Generation with Small MemoryFast Software Encryption | 18 May 2001
- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching ProgramsAutomata, Languages and Programming | 18 January 2002
- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract)Automata, Languages and Programming | 18 January 2002
- Efficient Communication-Storage Tradeoffs for Multicast EncryptionAdvances in Cryptology — EUROCRYPT ’99 | 15 April 1999
- Practice-Oriented Provable-SecurityLectures on Data Security | 29 March 2003
- On the Security of Random SourcesPublic Key Cryptography | 29 October 1999
- Computing from partial solutionsProceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) | 1 Jan 1999
- De-randomizing BPP: the state of the artProceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) | 1 Jan 1999
- Bound for linear complexity of quadratic functions in F/sub p/Proceedings IEEE 33rd Annual 1999 International Carnahan Conference on Security Technology (Cat. No.99CH36303) | 1 Jan 1999
- Multicast security: a taxonomy and some efficient constructionsIEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) | 1 Jan 1999
- Derandomizing Arthur-Merlin games using hitting sets40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) | 1 Jan 1999
- Verifiable random functions40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) | 1 Jan 1999
- Near-optimal conversion of hardness into pseudo-randomness40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) | 1 Jan 1999
- Design of Practical and Provably Good Random Number GeneratorsJournal of Algorithms, Vol. 29, No. 2 | 1 Nov 1998
- A Randomness-Rounds Tradeoff in Private ComputationSIAM Journal on Discrete Mathematics, Vol. 11, No. 1 | 1 August 2006
- Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-ReductionsAlgorithmic Learning Theory | 24 September 2002
- Computationally-Sound ProofsLogic Colloquium ’95 | 1 Jan 1998
- Practice-oriented provable-securityInformation Security | 17 June 2005
- An analytic approach to smooth polynomials over finite fieldsAlgorithmic Number Theory | 24 May 2006
- Do probabilistic algorithms outperform deterministic ones?Automata, Languages and Programming | 26 May 2006
- Micro-payments via efficient coin-flippingFinancial Cryptography | 28 May 2006
- From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACsAdvances in Cryptology — CRYPTO '98 | 28 May 2006
- Many-to-one trapdoor functions and their relation to public-key cryptosystemsAdvances in Cryptology — CRYPTO '98 | 28 May 2006
- An efficient discrete log pseudo random generatorAdvances in Cryptology — CRYPTO '98 | 28 May 2006
- Building PRFs from PRPsAdvances in Cryptology — CRYPTO '98 | 28 May 2006
- On the existence of 3-round zero-knowledge protocolsAdvances in Cryptology — CRYPTO '98 | 28 May 2006
- Computationally-sound checkersMathematical Foundations of Computer Science 1998 | 28 May 2006
- Gauss periods: orders and cryptographical applicationsMathematics of Computation, Vol. 67, No. 221 | 1 January 1998
- Proofs of membership vs. proofs of knowledgeProceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247) | 1 Jan 1998
- Making benchmarks uncheatableProceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248) | 1 Jan 1998
- The security of individual RSA bitsProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) | 1 Jan 1998
- Randomness vs. time: de-randomization under a uniform assumptionProceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) | 1 Jan 1998
- A new general derandomization methodJournal of the ACM, Vol. 45, No. 1 | 1 January 1998
- Randomness in Private ComputationsSIAM Journal on Discrete Mathematics, Vol. 10, No. 4 | 1 August 2006
- Computer Security and CryptographyThe Electrical Engineering Handbook,Second Edition | 12 March 2010
- Natural ProofsJournal of Computer and System Sciences, Vol. 55, No. 1 | 1 Aug 1997
- Optimal bounds for the approximation of boolean functions and some applicationsTheoretical Computer Science, Vol. 180, No. 1-2 | 1 Jun 1997
- Zeta functions, one-way functions, and pseudorandom number generatorsDuke Mathematical Journal, Vol. 88, No. 2 | 1 Jun 1997
- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offsAutomata, Languages and Programming | 8 June 2005
- Using hard problems to derandomize algorithms: An incomplete surveyRandomization and Approximation Techniques in Computer Science | 7 June 2005
- Super-bits, demi-bits, and NP/qpoly-natural proofsRandomization and Approximation Techniques in Computer Science | 7 June 2005
- Stronger Security Proofs for RSA and Rabin BitsAdvances in Cryptology — EUROCRYPT ’97 | 13 July 2001
- Round-Optimal Zero-Knowledge Arguments Based on Any One-Way FunctionAdvances in Cryptology — EUROCRYPT ’97 | 13 July 2001
- A Taxonomy of Proof SystemsComplexity Theory Retrospective II | 1 Jan 1997
- An information-theoretic treatment of random-self-reducibilitySTACS 97 | 10 June 2005
- Positive applications of lattices to cryptographyMathematical Foundations of Computer Science 1997 | 17 June 2005
- The complexity of computing hard core predicatesAdvances in Cryptology — CRYPTO '97 | 17 May 2006
- On the foundations of modern cryptographyAdvances in Cryptology — CRYPTO '97 | 17 May 2006
- “Pseudo-random” number generation within cryptographic algorithms: The DDS caseAdvances in Cryptology — CRYPTO '97 | 17 May 2006
- Efficient anonymous multicast and receptionAdvances in Cryptology — CRYPTO '97 | 17 May 2006
- The SHADE cipher: an efficient hash-function-based Feistel networkCCECE '97. Canadian Conference on Electrical and Computer Engineering. Engineering Innovation: Voyage of Discovery. Conference Proceedings | 1 Jan 1997
- New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)Proceedings 38th Annual Symposium on Foundations of Computer Science | 1 Jan 1997
- Number-theoretic constructions of efficient pseudo-random functionsProceedings 38th Annual Symposium on Foundations of Computer Science | 1 Jan 1997
- Efficient cryptographic schemes provably as secure as subset sumJournal of Cryptology, Vol. 9, No. 4 | 1 Sep 1996
- Pseudorandom generators and the frequency of simplicityJournal of Cryptology, Vol. 9, No. 4 | 1 Sep 1996
- Fundamentals of computing (a cheatlist)ACM SIGACT News, Vol. 27, No. 3 | 1 September 1996
- On the hardness of computing the permanent of random matricesComputational Complexity, Vol. 6, No. 2 | 1 Jun 1996
- Multisymbol majority vote and hard coreInformation Processing Letters, Vol. 58, No. 6 | 1 Jun 1996
- Software protection and simulation on oblivious RAMsJournal of the ACM, Vol. 43, No. 3 | 1 May 1996
- ISAACFast Software Encryption | 2 June 2005
- Hitting sets derandomize BPPAutomata, Languages and Programming | 2 June 2005
- An Efficient Pseudo-Random Generator Provably as Secure as Syndrome DecodingAdvances in Cryptology — EUROCRYPT ’96 | 13 July 2001
- On the Existence of Secure Feedback RegistersAdvances in Cryptology — EUROCRYPT ’96 | 13 July 2001
- Foiling Birthday Attacks in Length-Doubling TransformationsAdvances in Cryptology — EUROCRYPT ’96 | 13 July 2001
- All Bits in ax + b mod p are HardAdvances in Cryptology — CRYPTO ’96 | 13 July 2001
- Efficient and provably secure key agreementInformation Systems Security | 1 Jan 1996
- Cryptography based on transcendental numbersInformation Security and Privacy | 10 June 2005
- Multiple encryption with minimum keyCryptography: Policy and Algorithms | 28 June 2005
- Finite Fields and Their ApplicationsHandbook of Algebra | 1 Jan 1996
- Subquadratic zero-knowledgeJournal of the ACM, Vol. 42, No. 6 | 1 November 1995
- Fast generation of prime numbers and secure public-key cryptographic parametersJournal of Cryptology, Vol. 8, No. 3 | 1 Sep 1995
- Generation of solved instances of Multiconstraint Knapsack problem and its applications to Private Key CipherJournal of Information and Optimization Sciences, Vol. 16, No. 2 | 1 May 1995
- Necessary and sufficient conditions for collision-free hashingJournal of Cryptology, Vol. 8, No. 2 | 1 Mar 1995
- Proactive Secret Sharing Or: How to Cope With Perpetual LeakageAdvances in Cryptology — CRYPT0’ 95 | 13 July 2001
- Efficient Commitment Schemes with Bounded Sender and Unbounded ReceiverAdvances in Cryptology — CRYPT0’ 95 | 13 July 2001
- Pseudorandom generators and the frequency of simplicitySTACS 95 | 1 June 2005
- A Practical Conference Key Distribution SystemInformation Security — the Next Decade | 1 Jan 1995
- Zufall oder Unordnung?Grundlagen der Statistik und ihre Anwendungen | 1 Jan 1995
- Randomness, Interactive Proofs, and Zero-Knowledge — A SurveyThe Universal Turing Machine A Half-Century Survey | 1 Jan 1995
- Logical Depth and Physical ComplexityThe Universal Turing Machine A Half-Century Survey | 1 Jan 1995
- Optimal asymmetric encryptionAdvances in Cryptology — EUROCRYPT'94 | 23 May 2006
- A secure and efficient conference key distribution systemAdvances in Cryptology — EUROCRYPT'94 | 23 May 2006
- Computational pseudo-randomnessProceedings Third Israel Symposium on the Theory of Computing and Systems | 1 Jan 1995
- Synthesizers and their application to the parallel construction of pseudo-random functionsProceedings of IEEE 36th Annual Foundations of Computer Science | 1 Jan 1995
- The vulnerability of geometric sequences based on fields of odd characteristicJournal of Cryptology, Vol. 7, No. 1 | 1 Dec 1994
- Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean DomainSIAM Journal on Computing, Vol. 23, No. 5 | 13 July 2006
- The power of adaptiveness and additional queries in random-self-reductionsComputational Complexity, Vol. 4, No. 2 | 1 Jun 1994
- On randomization in sequential and distributed algorithmsACM Computing Surveys, Vol. 26, No. 1 | 1 March 1994
- Cryptographic limitations on learning Boolean formulae and finite automataJournal of the ACM, Vol. 41, No. 1 | 2 January 1994
- Construction of pseudorandom permutationsSystems and Computers in Japan, Vol. 25, No. 9 | 22 March 2007
- Interactive Hashing Simplifies Zero-Knowledge Protocol DesignAdvances in Cryptology — EUROCRYPT ’93 | 1 Jan 1994
- Global, Unpredictable Bit Generation Without BroadcastAdvances in Cryptology — EUROCRYPT ’93 | 1 Jan 1994
- Entity Authentication and Key DistributionAdvances in Cryptology — CRYPTO’ 93 | 1 Jan 1994
- The Shrinking GeneratorAdvances in Cryptology — CRYPTO’ 93 | 1 Jan 1994
- Another Method for Attaining Security Against Adaptively Chosen Ciphertext AttacksAdvances in Cryptology — CRYPTO’ 93 | 1 Jan 1994
- Cryptographic Randomness from Air Turbulence in Disk DrivesAdvances in Cryptology — CRYPTO ’94 | 1 Jan 1994
- A Randomness-Rounds Tradeoff in Private ComputationAdvances in Cryptology — CRYPTO ’94 | 1 Jan 1994
- Open problems in number theoretic complexity, IIAlgorithmic Number Theory | 4 June 2005
- My favorite ten complexity theorems of the past decadeFoundation of Software Technology and Theoretical Computer Science | 1 June 2005
- Transparent Proofs and Limits to ApproximationFirst European Congress of Mathematics | 1 Jan 1994
- Transparent Proofs and Limits to ApproximationFirst European Congress of Mathematics Paris, July 6–10, 1992 | 1 Jan 1994
- Secure distributed computing: Theory and practiceDistributed Algorithms | 10 June 2005
- Lectures on survival analysisLectures on Probability Theory | 13 September 2006
- Security mechanism for distributed systemsProceedings of IEEE International Carnahan Conference on Security Technology CCST-94 | 1 Jan 1994
- Space lower-bounds for pseudorandom-generatorsProceedings of IEEE 9th Annual Conference on Structure in Complexity Theory | 1 Jan 1994
- Algorithmic number theory-the complexity contributionProceedings 35th Annual Symposium on Foundations of Computer Science | 1 Jan 1994
- CS proofsProceedings 35th Annual Symposium on Foundations of Computer Science | 1 Jan 1994
- On the Existence of Pseudorandom GeneratorsSIAM Journal on Computing, Vol. 22, No. 6 | 31 July 2006
- Mathematical problems in cryptologyJournal of Soviet Mathematics, Vol. 67, No. 6 | 1 Dec 1993
- BPP has subexponential time simulations unlessEXPTIME has publishable proofsComputational Complexity, Vol. 3, No. 4 | 1 Dec 1993
- Randomness in interactive proofsComputational Complexity, Vol. 3, No. 4 | 1 Dec 1993
- The discrete logarithm modulo a composite hides 0(n) BitsJournal of Computer and System Sciences, Vol. 47, No. 3 | 1 Dec 1993
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, Vol. 47, No. 3 | 1 Dec 1993
- Random-Self-Reducibility of Complete SetsSIAM Journal on Computing, Vol. 22, No. 5 | 31 July 2006
- Local Randomness in Polynomial Random Number and Random Function GeneratorsSIAM Journal on Computing, Vol. 22, No. 4 | 31 July 2006
- An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/IEEE Transactions on Information Theory, Vol. 39, No. 4 | 1 Jul 1993
- Randomized algorithms and pseudorandom numbersJournal of the ACM, Vol. 40, No. 3 | 1 July 1993
- Bounds on tradeoffs between randomness and communication complexityComputational Complexity, Vol. 3, No. 2 | 1 Jun 1993
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithmJournal of Cryptology, Vol. 6, No. 2 | 1 Jun 1993
- A new method for analyzing the security of cryptographic protocolsIEEE Journal on Selected Areas in Communications, Vol. 11, No. 5 | 1 Jun 1993
- Immunizing public key cryptosystems against chosen ciphertext attacksIEEE Journal on Selected Areas in Communications, Vol. 11, No. 5 | 1 Jun 1993
- Universal tests for nonuniform distributionsJournal of Cryptology, Vol. 6, No. 3 | 1 Mar 1993
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, Vol. 6, No. 1 | 1 Mar 1993
- Algorithmic Complexity and Randomness: Recent DevelopmentsTheory of Probability & Its Applications, Vol. 37, No. 1 | 28 July 2006
- Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity AssumptionsAdvances in Cryptology — CRYPTO’ 92 | 1 Jan 1993
- Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are EquivalentAdvances in Cryptology — CRYPTO’ 92 | 1 Jan 1993
- Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext AttacksAdvances in Cryptology — CRYPTO’ 92 | 1 Jan 1993
- Necessary and Sufficient Conditions for Collision-Free HashingAdvances in Cryptology — CRYPTO’ 92 | 1 Jan 1993
- Fair Public-Key CryptosystemsAdvances in Cryptology — CRYPTO’ 92 | 1 Jan 1993
- Secure and efficient off-line digital money (extended abstract)Automata, Languages and Programming | 28 May 2005
- A practical digital multisignature scheme based on discrete logarithms (extended abstract)Advances in Cryptology — AUSCRYPT '92 | 31 May 2005
- On bit correlations among preimages of “Many to one” One-way functionsAdvances in Cryptology — AUSCRYPT '92 | 31 May 2005
- Revealing information with partial period correlations (extended abstract)Advances in Cryptology — ASIACRYPT '91 | 28 May 2005
- Formal verification of probabilistic properties in cryptographic protocolsAdvances in Cryptology — ASIACRYPT '91 | 28 May 2005
- How to construct a family of strong one way permutationsAdvances in Cryptology — ASIACRYPT '91 | 28 May 2005
- The Discrete Logarithm ProblemApplications of Finite Fields | 1 Jan 1993
- One-way functions are essential for non-trivial zero-knowledge[1993] The 2nd Israel Symposium on Theory and Computing Systems | 1 Jan 1993
- Pseudorandom generators for space-bounded computationCombinatorica, Vol. 12, No. 4 | 1 Dec 1992
- How to predict congruential generatorsJournal of Algorithms, Vol. 13, No. 4 | 1 Dec 1992
- Picture data encryption using scan patternsPattern Recognition, Vol. 25, No. 6 | 1 Jun 1992
- Almost everywhere high nonuniform complexityJournal of Computer and System Sciences, Vol. 44, No. 2 | 1 Apr 1992
- How to sign given any trapdoor permutationJournal of the ACM, Vol. 39, No. 1 | 2 January 1992
- Sparse pseudorandom distributionsRandom Structures & Algorithms, Vol. 3, No. 2 | 9 March 2007
- Deriving the Complete Knowledge of Participants in Cryptographic ProtocolsAdvances in Cryptology — CRYPTO ’91 | 1 Jan 1992
- Secure ComputationAdvances in Cryptology — CRYPTO ’91 | 1 Jan 1992
- Non-Interactive and Information-Theoretic Secure Verifiable Secret SharingAdvances in Cryptology — CRYPTO ’91 | 1 Jan 1992
- The complexity of graph connectivityMathematical Foundations of Computer Science 1992 | 30 July 2005
- Resource Bounded Kolmogorov Complexity and Statistical TestsKolmogorov Complexity and Computational Complexity | 1 Jan 1992
- Separating the specification and implementation phases in cryptologyComputer Security — ESORICS 92 | 9 June 2005
- The Monte Carlo algorithm with a pseudorandom generatorMathematics of Computation, Vol. 58, No. 197 | 1 January 1992
- A note on the instance complexity of pseudorandom sets[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference | 1 Jan 1992
- The power of adaptiveness and additional queries in random-self-reductions[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference | 1 Jan 1992
- Towards a computational theory of statistical testsProceedings., 33rd Annual Symposium on Foundations of Computer Science | 1 Jan 1992
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, Vol. 20, No. 6 | 13 July 2006
- An introduction to randomized algorithmsDiscrete Applied Mathematics, Vol. 34, No. 1-3 | 1 Nov 1991
- Constant-round perfect zero-knowledge computationally convincing protocolsTheoretical Computer Science, Vol. 84, No. 1 | 1 Jul 1991
- Realistic analysis of some randomized algorithmsJournal of Computer and System Sciences, Vol. 42, No. 1 | 1 Feb 1991
- Note on the efficiency of methods to generate quasi‐random sequencesSystems and Computers in Japan, Vol. 22, No. 2 | 21 March 2007
- How to Time-Stamp a Digital DocumentAdvances in Cryptology-CRYPT0’ 90 | 1 Jan 1991
- One-Way Group ActionsAdvances in Cryptology-CRYPT0’ 90 | 1 Jan 1991
- A Construction for One Way Hash Functions and Pseudorandom Bit GeneratorsAdvances in Cryptology — EUROCRYPT ’91 | 1 Jan 1991
- How to Construct Pseudorandom Permutations from Single Pseudorandom FunctionsAdvances in Cryptology — EUROCRYPT ’90 | 18 May 2001
- Duality between two cryptographic primitivesApplied Algebra, Algebraic Algorithms and Error-Correcting Codes | 8 June 2005
- Local randomness in pseudorandom sequencesJournal of Cryptology, Vol. 4, No. 2 | 1 Jan 1991
- Bit commitment using pseudorandomnessJournal of Cryptology, Vol. 4, No. 2 | 1 Jan 1991
- How to time-stamp a digital documentJournal of Cryptology, Vol. 3, No. 2 | 1 Jan 1991
- Efficient, perfect polynomial random number generatorsJournal of Cryptology, Vol. 3, No. 3 | 1 Jan 1991
- On the random-self-reducibility of complete sets[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference | 1 Jan 1991
- One-way functions, hard on average problems, and statistical zero-knowledge proofs[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference | 1 Jan 1991
- BPP has subexponential time simulations unless EXPTIME has publishable proofs[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference | 1 Jan 1991
- Subquadratic zero-knowledge[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science | 1 Jan 1991
- Pseudorandom sources for BPPJournal of Computer and System Sciences, Vol. 41, No. 3 | 1 Dec 1990
- A note on computational indistinguishabilityInformation Processing Letters, Vol. 34, No. 6 | 1 May 1990
- A short proof for explicit formulas for discrete logarithms in finite fieldsApplicable Algebra in Engineering, Communication and Computing, Vol. 1, No. 1 | 1 Mar 1990
- On the Existence of Pseudorandom GeneratorsAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- On The Randomness of Legendre and Jacobi SequencesAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- How To Sign Given Any Trapdoor FunctionAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- Limits on the Provable Consequences of One-way PermutationsAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- Proving Security Against Chosen Ciphertext AttacksAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- Non-Interactive Zero-Knowledge with PreprocessingAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- On Generating Solved Instances of Computational ProblemsAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete LogarithmAdvances in Cryptology — CRYPTO’ 88 | 1 December 2000
- Perfect Local Randomness in Pseudo-random SequencesAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- Sparse Pseudorandom DistributionsAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- Bit Commitment Using Pseudo-RandomnessAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- How to Predict Congruential GeneratorsAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- Batch RSAAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved HypothesesAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- Non-Interactive Oblivious Transfer and ApplicationsAdvances in Cryptology — CRYPTO’ 89 Proceedings | 1 Jan 1990
- A Secure Public-Key Authentication SchemeAdvances in Cryptology — EUROCRYPT ’89 | 1 Jan 1990
- On the Security of Schnorr’s Pseudo Random GeneratorAdvances in Cryptology — EUROCRYPT ’89 | 1 Jan 1990
- Fast Generation of Secure RSA-Moduli with Almost Maximal DiversityAdvances in Cryptology — EUROCRYPT ’89 | 1 Jan 1990
- Removing Interaction from Zero-Knowledge ProofsSequences | 1 Jan 1990
- A discrete logarithm implementation of perfect zero-knowledge blobsJournal of Cryptology, Vol. 2, No. 2 | 1 Jan 1990
- CryptographyAlgorithms and Complexity | 1 Jan 1990
- Cryptography Based Data SecurityAdvances in Computers Volume 30 | 1 Jan 1990
- A fair protocol for signing contractsIEEE Transactions on Information Theory, Vol. 36, No. 1 | 1 Jan 1990
- Separating distribution-free and mistake-bound learning models over the Boolean domainProceedings [1990] 31st Annual Symposium on Foundations of Computer Science | 1 Jan 1990
- Multiple non-interactive zero knowledge proofs based on a single random stringProceedings [1990] 31st Annual Symposium on Foundations of Computer Science | 1 Jan 1990
- Security preserving amplification of hardnessProceedings [1990] 31st Annual Symposium on Foundations of Computer Science | 1 Jan 1990
- Randomness in interactive proofsProceedings [1990] 31st Annual Symposium on Foundations of Computer Science | 1 Jan 1990
- Lower bounds on random-self-reducibilityProceedings Fifth Annual Structure in Complexity Theory Conference | 1 Jan 1990
- A study of password securityJournal of Cryptology, Vol. 1, No. 3 | 1 Oct 1989
- Minimum-Knowledge Interactive Proofs for Decision ProblemsSIAM Journal on Computing, Vol. 18, No. 4 | 13 July 2006
- Some consequences of the existence of pseudorandom generatorsJournal of Computer and System Sciences, Vol. 39, No. 1 | 1 Aug 1989
- A new algorithm for multiplication in finite fieldsIEEE Transactions on Computers, Vol. 38, No. 7 | 1 Jul 1989
- On the power of two-point based samplingJournal of Complexity, Vol. 5, No. 1 | 1 Mar 1989
- Good stream ciphers are hard to designProceedings. International Carnahan Conference on Security Technology | 1 Jan 1989
- Almost everywhere high nonuniform complexity[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference | 1 Jan 1989
- One-way functions are essential for complexity based cryptography30th Annual Symposium on Foundations of Computer Science | 1 Jan 1989
- Efficient cryptographic schemes provably as secure as subset sum30th Annual Symposium on Foundations of Computer Science | 1 Jan 1989
- How to recycle random bits30th Annual Symposium on Foundations of Computer Science | 1 Jan 1989
- Minimum resource zero knowledge proofs30th Annual Symposium on Foundations of Computer Science | 1 Jan 1989
- About Polynomial-Ttime "Unpredictable" Generators1989 Winter Simulation Conference Proceedings | 1 Jan 1989
- An unpredictability approach to finite-state randomnessJournal of Computer and System Sciences, Vol. 37, No. 3 | 1 Dec 1988
- Expanders, randomness, or time versus spaceJournal of Computer and System Sciences, Vol. 36, No. 3 | 1 Jun 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, Vol. 17, No. 2 | 13 July 2006
- Complexity Measures for Public-Key CryptosystemsSIAM Journal on Computing, Vol. 17, No. 2 | 13 July 2006
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, Vol. 17, No. 2 | 13 July 2006
- Efficient Parallel Pseudorandom Number GenerationSIAM Journal on Computing, Vol. 17, No. 2 | 13 July 2006
- Probabilistic Strategies in Finite Games with Complete InformationTheory of Probability & Its Applications, Vol. 32, No. 3 | 17 July 2006
- Collision Free Hash Functions and Public Key Signature SchemesAdvances in Cryptology — EUROCRYPT ’87 | 1 Jan 1988
- Special Uses and Abuses of the Fiat-Shamir Passport Protocol (extended abstract)Advances in Cryptology — CRYPTO ’87 | 1 December 2000
- How to Make Replicated Data SecureAdvances in Cryptology — CRYPTO ’87 | 1 December 2000
- On the existence of pseudorandom generators[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science | 1 Jan 1988
- Homogeneous measures and polynomial time invariants[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science | 1 Jan 1988
- One way functions and pseudorandom generatorsCombinatorica, Vol. 7, No. 4 | 1 Dec 1987
- One-way permutations in NC0Information Processing Letters, Vol. 26, No. 3 | 1 Nov 1987
- Interactive proof systems: Provers that never fail and random selection28th Annual Symposium on Foundations of Computer Science (sfcs 1987) | 1 Oct 1987
- One-way functions and circuit complexityInformation and Computation, Vol. 74, No. 3 | 1 Sep 1987
- On using deterministic functions to reduce randomness in probabilistic algorithmsInformation and Computation, Vol. 74, No. 3 | 1 Sep 1987
- On solving hard problems by polynomial-size circuitsInformation Processing Letters, Vol. 24, No. 3 | 1 Feb 1987
- A Pseudo-Random Bit Generator Based on Elliptic LogarithmsAdvances in Cryptology — CRYPTO’ 86 | 1 December 2000
- Probabilistic AlgorithmsAlgorithmics | 1 Jan 1987
- Technischer Datenschutz und Fehlertoleranz in KommunikationssystemenKommunikation in Verteilten Systemen | 1 Jan 1987
- Open Problems in Number Theoretic ComplexityDiscrete Algorithms and Complexity | 1 Jan 1987
- The NP-completeness column: An ongoing guideJournal of Algorithms, Vol. 7, No. 4 | 1 Dec 1986
- How to construct random functionsJournal of the ACM, Vol. 33, No. 4 | 10 August 1986
- Generating quasi-random sequences from semi-random sourcesJournal of Computer and System Sciences, Vol. 33, No. 1 | 1 Aug 1986
- Random sequence generation by cellular automataAdvances in Applied Mathematics, Vol. 7, No. 2 | 1 Jun 1986
- Expanders, randomness, or time versus spaceStructure in Complexity Theory | 2 June 2005
- One-way functions and circuit complexityStructure in Complexity Theory | 2 June 2005
- Efficient Parallel Pseudo-Random Number GenerationAdvances in Cryptology — CRYPTO ’85 Proceedings | 1 Jan 1986
- The Bit Security of Modular Squaring given Partial Factorization of the ModulosAdvances in Cryptology — CRYPTO ’85 Proceedings | 1 Jan 1986
- The Importance of “Good” Key Scheduling Schemes (How to Make a Secure DES* Scheme with ≤ 48 Bit Keys?)Advances in Cryptology — CRYPTO ’85 Proceedings | 1 Jan 1986
- Using Algorithms as Keys in Stream CiphersAdvances in Cryptology — EUROCRYPT’ 85 | 1 Jan 1986
- Origins of randomness in physical systemsPhysical Review Letters, Vol. 55, No. 5 | 29 July 1985
- On the Cryptographic Applications of Random Functions (Extended Abstract)Advances in Cryptology | 1 Jan 1985
- Technischer Datenschutz in Dienstintegrierenden Digitalnetzen — Problemanalyse, Lösungsansätze und Eine Angepasste SystemstrukturDatenschutz und Datensicherung im Wandel der Informationstechnologien | 1 Jan 1985
- A fair protocol for signing contractsAutomata, Languages and Programming | 7 June 2005
- Deterministic simulation of probabilistic constant depth circuits26th Annual Symposium on Foundations of Computer Science (sfcs 1985) | 1 Jan 1985
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].