A pseudo-random bit generator based on elliptic logarithms
Proceedings on Advances in cryptology---CRYPTO '86
Two remarks concerning the Goldwasser-Micali-Rivest signature scheme
Proceedings on Advances in cryptology---CRYPTO '86
How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design
Proceedings on Advances in cryptology---CRYPTO '86
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Towards a theory of software protection
Proceedings on Advances in cryptology---CRYPTO '86
Limits on the provable consequences of one-way permutations (invited talk)
CRYPTO '88 Proceedings on Advances in cryptology
A “paradoxical” identity-based signature scheme resulting from zero-knowledge
CRYPTO '88 Proceedings on Advances in cryptology
Efficient Parallel Pseudo-Random Number Generation
CRYPTO '85 Advances in Cryptology
How to Reduce Your Enemy's Information (Extended Abstract)
CRYPTO '85 Advances in Cryptology
Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Convertible Undeniable Signatures
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Traitors Collaborating in Public: Pirates 2.0
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
A Leakage-Resilient Mode of Operation
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Algorithmic Tamper Proof (ATP) Counter Units for Authentication Devices Using PIN
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Practical electronic lotteries with offline TTP
Computer Communications
New convertible undeniable signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Quantum oblivious mutual identification
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Resistance against general iterated attacks
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
ZKPDL: a language-based system for efficient zero-knowledge proofs and electronic cash
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
An e-lottery scheme using verifiable random function
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Unclonable group identification
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Computing on authenticated data
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Practical leakage-resilient pseudorandom objects with minimum public randomness
CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.01 |
This paper develops a constructive theory of randomness for functions based on computational complexity. We present a deterministic polynomial-time algorithm that transforms pairs (g,r), where g is any one-way (in a very weak sense) function and r is a random k-bit string, to polynomial-time computable functions f/sub r/:{1,..., 2/sup k} /spl I.oarr/ {1, ..., 2/sup k/}. These f/sub r/'s cannot be distinguished from random functions by any probabilistic polynomial time algorithm that asks and receives the value of a function at arguments of its choice. The result has applications in cryptography, random constructions and complexity theory.