Non-cryptographic fault-tolerant computing in constant number of rounds of interaction

The round complexity of secure protocols

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

Multiparty protocols tolerating half faulty processors

CRYPTO '89 Proceedings on Advances in cryptology

Communication complexity of secure computation (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing

Receipt-free secret-ballot elections (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Characterizing linear size circuits in terms of privacy

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Randomness in private computations

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing

Randomness vs. fault-tolerance

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing

Amortizing randomness in private multiparty computations

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

A theorem on sensitivity and applications in private computation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

The round complexity of verifiable secret sharing and secure multicast

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Communication preserving protocols for secure function evaluation

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Efficient generation of shared RSA keys

Journal of the ACM (JACM)

Randomness Recycling in Constant-Round Private Computations (extended Abstract)

Proceedings of the 13th International Symposium on Distributed Computing

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

Private Computations in Networks: Topology versus Randomness

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science

One-Time Tables for Two-Party Computation

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics

Adaptive Security for Threshold Cryptosystems

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology

Robustness for Free in Unconditional Multi-party Computation

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology

Secure Distributed Linear Algebra in a Constant Number of Rounds

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology

On 2-Round Secure Multiparty Computation

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

Private Computation - k-Connected versus 1-Connected Networks

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

Security with Low Communication Overhead

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

Efficient Multiparty Protocols Using Circuit Randomization

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

A Randomnesss-Rounds Tradeoff in Private Computation

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology

Multiparty Computation from Threshold Homomorphic Encryption

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology

Efficient Asynchronous Secure Multiparty Distributed Computation

INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology

Efficient Secure Multi-party Computation

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

Introduction to Secure Computation

Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998

A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

Client/Server Tradeoffs for Online Elections

PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography

Lower bounds on the amount of randomness in private computation

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

Non-Interactive CryptoComputing For NC1

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Resilient-optimal interactive consistency in constant time

Distributed Computing

Privacy-preserving distributed k-means clustering over arbitrarily partitioned data

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining

Efficient Disjointness Tests for Private Datasets

ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy

Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries

CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

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

Unconditionally secure disjointness tests for private datasets

International Journal of Applied Cryptography

Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Distributing the Key Distribution Centre in Sakai---Kasahara Based Systems

Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding

Cryptographic protocols provably secure against dynamic adversaries

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

Computing inverses over a shared secret modulus

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Minimal-latency secure function evaluation

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Improved on-line/off-line threshold signatures

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography

Multiparty computation for interval, equality, and comparison without bit-decomposition protocol

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography

Secure linear algebra using linearly recurrent sequences

TCC'07 Proceedings of the 4th conference on Theory of cryptography

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 multi-party computation over rings

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

Some applications of polynomials for the design of cryptographic protocols

SCN'02 Proceedings of the 3rd international conference on Security in communication networks

Seeing through mist given a small fraction of an RSA private key

CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track

Scalable and unconditionally secure multiparty computation

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology

On secure multi-party computation in black-box groups

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology

A note on secure computation of the moore-penrose pseudoinverse and its application to secure linear algebra

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology

Secure multiparty computation with minimal interaction

CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology

Linear, constant-rounds bit-decomposition

ICISC'09 Proceedings of the 12th international conference on Information security and cryptology

Improved primitives for secure multiparty integer computation

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks

Distributed private-key generators for identity-based cryptography

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks

Sub-linear, secure comparison with two non-colluding parties

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

Round-efficient sub-linear zero-knowledge arguments for linear algebra

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

Threshold signature schemes for ElGamal variants

Computer Standards & Interfaces

Privacy-preserving distributed network troubleshooting—bridging the gap between theory and practice

ACM Transactions on Information and System Security (TISSEC)

Practical PIR for electronic commerce

Proceedings of the 18th ACM conference on Computer and communications security

Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security

Short threshold signature schemes without random oracles

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India

Optimizing robustness while generating shared secret safe primes

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography

A verifiable random function with short proofs and keys

PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography

Constant-round multiparty computation using a black-box pseudorandom generator

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Multi-party computation with conversion of secret sharing

Designs, Codes and Cryptography

Robust multiparty computation with linear communication complexity

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

On combining privacy with guaranteed output delivery in secure multiparty computation

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Efficient polynomial operations in the shared-coefficients setting

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography

Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Threshold and proactive pseudo-random permutations

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Constant-Rounds, linear multi-party computation for exponentiation and modulo reduction with perfect security

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Accelerating multiparty computation by efficient random number bitwise-sharing protocols

WISA'11 Proceedings of the 12th international conference on Information Security Applications

Improved secure two-party computation via information-theoretic garbled circuits

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation

SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks

Secure equality and greater-than tests with sublinear online complexity

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II

Towards a practical cryptographic voting scheme based on malleable proofs

Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity