How to construct random functions
Journal of the ACM (JACM)
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
ACISP '00 Proceedings of the 5th Australasian Conference on Information Security and Privacy
Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Distributed Pseudo-random functions and KDCs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient Construction of (Distributed) Verifiable Random Functions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
An asynchronous protocol for distributed computation of RSA inverses and its applications
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Efficient player-optimal protocols for strong and differential consensus
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Fast asynchronous byzantine agreement and leader election with full information
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Asynchronous Multi-Party Computation with Quadratic Communication
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
A theoretical treatment of related-key attacks: RKA-PRPS, RKA-PRFs, and applications
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms (TALG)
On the theoretical gap between synchronous and asynchronous MPC protocols
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Cryptographic asynchronous multi-party computation with optimal resilience
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
LATINCRYPT'12 Proceedings of the 2nd international conference on Cryptology and Information Security in Latin America
| Hi-index | 0.00 |
We give the first construction of a practical threshold pseudo-random function. The protocol for evaluating the function is efficient enough that it can be used to replace random oracles in some protocols relying on such oracles. In particular, we show how to transform the efficient cryptographically secure Byzantine agreement protocol by Cachin, Kursawe and Shoup for the random oracle model into a cryptographically secure protocol for the complexity theoretic model without loosing efficiency or resilience, thereby constructing an efficient and optimally resilient Byzantine agreement protocol for the complexity theoretic model.