STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A zero-one law for Boolean privacy
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
Complexity and security of distributed protocols
Complexity and security of distributed protocols
How to share a function securely
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Robust sharing of secrets when the dealer is honest or cheating
Journal of the ACM (JACM)
The Design and Implementation of a Secure Auction Service
IEEE Transactions on Software Engineering
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Incoercible multiparty computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Multi-authority secret-ballot elections with linear work
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On the complexity of verifiable secret sharing and multiparty computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Compressing Cryptographic Resources
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Toward Optimal Player Weights in Secure Distributed Protocols
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
ASIACRYPT '02 Proceedings of the 8th 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
Synchronous Consensus for Dependent Process Failures
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Distributed consensus in the presence of sectional faults
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Cryptography and mechanism design
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Possibility and complexity of probabilistic reliable communication in directed networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
ACM SIGACT news distributed computing column 24
ACM SIGACT News
Integrity and its applications
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Optimizing Threshold Protocols in Adversarial Structures
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
MPC vs. SFE: Unconditional and Computational Security
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Efficient multiparty computations secure against an adaptive adversary
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Two-threshold broadcast and detectable multi-party computation
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
Secure multi-party computation made simple
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
On secure multi-party computation in black-box groups
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
MPC vs. SFE: perfect security in a unified corruption model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Dependability metrics
Designing algorithms for dependent process failures
Future directions in distributed computing
P4P: practical large-scale privacy-preserving distributed computation robust against malicious users
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Cryptography and Communications
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
The round complexity of perfectly secure general VSS
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Graceful degradation in multi-party computation
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Player-centric Byzantine agreement
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Byzantine agreement using partial authentication
DISC'11 Proceedings of the 25th international conference on Distributed computing
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Replication predicates for dependent-failure algorithms
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
On codes, matroids and secure multi-party computation from linear secret sharing schemes
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
Theory and practice of multiparty computation
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Verifiable agreement: limits of non-repudiation in mobile peer-to-peer ad hoc networks
ESAS'06 Proceedings of the Third European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Recursive hiding of biometrics-based secret sharing scheme using adversary structure
Information Processing Letters
Passive corruption in statistical multi-party computation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Active security in multiparty computation over black-box groups
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |