Achieving independence in logarithmic number of rounds

The round complexity of secure protocols

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Non-malleable cryptography

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Achieving independence efficiently and securely

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing

A Protocol to Achieve Independence in Constant Rounds

IEEE Transactions on Parallel and Distributed Systems

How to Make Replicated Data Secure

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on 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

Fair Computation of General Functions in Presence of Immoral Majority

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology

On Verification in Secret Sharing

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology

Mutually Independent Commitments

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology

Cryptography and cryptographic protocols

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Bounded-concurrent secure multi-party computation with a dishonest majority

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Concurrent general composition of secure protocols in the timing model

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Simultaneous broadcast revisited

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing

Foundations of cryptography: a primer

Foundations and Trends® in Theoretical Computer Science

A practical scheme for non-interactive verifiable secret sharing

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Cryptographic protocols provably secure against dynamic adversaries

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Round efficiency of multi-party computation with a dishonest majority

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

Efficient two party and multi party computation against covert adversaries

EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology

Efficient simultaneous broadcast

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography

Private web search with malicious adversaries

PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies

Constant-round non-malleable commitments from any one-way function

Proceedings of the forty-third annual ACM symposium on Theory of computing

Adaptively secure broadcast

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques

Universally composable simultaneous broadcast

SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks

Attacking and fixing Helios: An analysis of ballot secrecy

Journal of Computer Security