Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
Authors:
- 1 January 2014
- book chapter
- Published by Springer Nature
- p. 102-121
Abstract
No abstract availableKeywords
This publication has 54 references indexed in Scilit:
- Regularity of Lossy RSA on Subdomains and Its ApplicationsLecture Notes in Computer Science, 2013
- Towards realizing random oracles: Hash functions that hide all partial information1997
- The discrete logarithm modulo a composite hides 0(n) BitsJournal of Computer and System Sciences, 1993
- The Discrete Logarithm Hides $O(\log n)$ BitsSIAM Journal on Computing, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978