A randomized protocol for signing contracts
Communications of the ACM
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Secret sharing homomorphisms: keeping shares of a secret secret
Proceedings on Advances in cryptology---CRYPTO '86
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
CRYPTO '89 Proceedings on Advances in cryptology
Correlated pseudorandomness and the complexity of private computations
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Adaptive zero knowledge and computational equivocation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
More general completeness theorems for secure two-party computation
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Semi-trusted Hosts and Mobile Agents: Enabling Secure Distributed Computations
MATA '00 Proceedings of the Second International Workshop on Mobile Agents for Telecommunication Applications
The All-or-Nothing Nature of Two-Party Secure Computation
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference 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
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
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Joint Encryption and Message-Efficient Secure Computation
CRYPTO '93 Proceedings of the 13th 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
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Distributed Oblivious Transfer
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
Non-interactive Private Auctions
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Non-Interactive CryptoComputing For NC1
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Cryptography and cryptographic protocols
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Journal of Complexity - Special issue on coding and cryptography
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Cryptography with constant computational overhead
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Statistical Security Conditions for Two-Party Secure Function Evaluation
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Counting Method for Multi-party Computation over Non-abelian Groups
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Graph Design for Secure Multiparty Computation over Non-Abelian Groups
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science
Oblivious Transfer from Weak Noisy Channels
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Oblivious Multi-variate Polynomial Evaluation
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Basing cryptographic protocols on tamper-evident seals
Theoretical Computer Science
On the reversibility of oblivious transfer
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Scalable and unconditionally secure multiparty computation
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Multi-party indirect indexing and applications
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
OT-combiners via secure computation
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Oblivious transfer based on physical unclonable functions
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Generalized oblivious transfer by secret sharing
Designs, Codes and Cryptography
Non-local box complexity and secure function evaluation
Quantum Information & Computation
Robust cryptography in the noisy-quantum-storage model
Quantum Information & Computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Founding cryptography on tamper-proof hardware tokens
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Secure computation of the mean and related statistics
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
t-out-of-n string/bit oblivious transfers revisited
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Robust multiparty computation with linear communication complexity
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences
Private multiparty sampling and approximation of vector combinations
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
Consider n parties having local inputs x1x2,....xn respectively, and wishing to compute the value f(x1,... ,xn). where f is a predetermined function. Loosely speaking, an n-party protocol for this purpose has maximum privacy if whatever a subset of the users can efficiently compute when participating in the protocol, they can also compute from their local inputs and the value f(x1,...,xn).Recently, Goldreich, Micali and Wigderson have presented a polynomial-time algorithm that, given a Turing machine for computing the function f, outputs an n-party protocol with maximum privacy for distributively computing f (x1,....,xn The maximum privacy protocol output uses as a subprotocol a maximum privacy two-party protocol for computing a particular simple function P1(驴). More recently, Haber and Micali have improved the efficiency of the above n-party protocols, using a maximum privacy two-party protocol for computing another particular function P2(驴). Both works use a general result of Yao in order to implement protocols for the particular functions p1 and p2.In this paper, we present direct solutions to the above two particular protocol problems, avoiding the use of Yao's general result. In fact, we present two alternative approaches for solving both problems. The first approach consists of a simple reduction of these two problems to a variant of Oblivious Transfer. The second approach consists of designing direct solutions to these two problems, assuming the intractability of the Quadratic Residuosity problem. Both approaches yield simpler and more efficient solutions than the ones obtained by Yao's result.