The round complexity of secure protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Communications of the ACM
The round complexity of verifiable secret sharing and secure multicast
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Compressing Cryptographic Resources
CRYPTO '99 Proceedings of the 19th 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
Generalized Secret Sharing and Monotone Functions
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Adaptive versus Non-Adaptive Security of Multi-Party Protocols
Journal of Cryptology
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
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
Secure multi-party computation made simple
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
Communication in the presence of replication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Non-interactive Proofs for Integer Multiplication
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Simplified Submission of Inputs to Protocols
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Asynchronous Multiparty Computation: Theory and Implementation
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
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
Perfect NIZK with adaptive soundness
TCC'07 Proceedings of the 4th conference on Theory of cryptography
OT-combiners via secure computation
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Secure multiparty computation with minimal interaction
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Provably secure higher-order masking of AES
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Improved primitives for secure multiparty integer computation
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Secure multiparty linear programming using fixed-point arithmetic
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Efficient, robust and constant-round distributed RSA key generation
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems
TCC'10 Proceedings of the 7th international conference on Theory of 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
Secure computation with fixed-point numbers
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
A practical implementation of secure auctions based on multiparty integer computation
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Scalable secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Accelerating multiparty computation by efficient random number bitwise-sharing protocols
WISA'11 Proceedings of the 12th international conference on Information Security Applications
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Secure distributed computation of the square root and applications
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Functional encryption for threshold functions (or fuzzy IBE) from lattices
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Efficient threshold zero-knowledge with applications to user-centric protocols
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
PICCO: a general-purpose compiler for private distributed computation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Towards efficient private distributed computation on unbounded input streams
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Towards a practical cryptographic voting scheme based on malleable proofs
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Secure outsourced computation of iris matching
Journal of Computer Security
Hi-index | 0.00 |
We present a method for converting shares of a secret into shares of the same secret in a different secret-sharing scheme using only local computation and no communication between players. In particular, shares in a replicated scheme based on a CNF representation of the access structure can be converted into shares from any linear scheme for the same structure. We show how this can be combined with any pseudorandom function to create, from initially distributed randomness, any number of Shamir secret-sharings of (pseudo)random values without communication. We apply this technique to obtain efficient non-interactiveprotocols for secure computation of low-degree polynomials, which in turn give rise to other applications in secure computation and threshold cryptography. For instance, we can make the Cramer-Shoup threshold cryptosystem by Canetti and Goldwasser fully non-interactive, or construct non-interactive threshold signature schemes secure without random oracles. The latter solutions are practical only for a relatively small number of players. However, in our main applications the number of players is typically small, and furthermore it can be argued that no solution that makes a black-box use of a pseudorandom function can be more efficient.