#### DMCA

## Accumulating Automata and Cascaded Equations Automata⋆ for Communicationless Information Theoretically Secure Multi-Party Computation (Preliminary Report)

Citations: | 1 - 1 self |

### Citations

2580 | How to Share a Secret
- Shamir
- 1979
(Show Context)
Citation Context ...y, based on the common belief on the complexity of mathematical tasks such as factoring, or information theoretically secure which is unconditional secure, and usually based on secret sharing schemes =-=[28, 5]-=-. – The settings in which the scheme is described may differ, possibly assuming that participants use a synchronized network, that a secure and reliable broadcast channel exists, that a secure communi... |

847 |
Completeness theorems for non-cryptographic fault-tolerant distributed computation.
- Ben-Or, Goldwasser, et al.
- 1988
(Show Context)
Citation Context ...s for computing general functions [21]. However, the general scheme presented in [21] may be impractical due to efficiency reasons, partly due to the communication required among the participants. In =-=[2]-=-, Ben-Or et al demonstrated that any n-party functionality can be computed with perfect security in the private channels model. For the main result of [2], Gilad Asharov and Yehuda Lindell gave a full... |

663 | Fully homomorphic encryption using ideal lattices
- Gentry
(Show Context)
Citation Context ... and storage complexity. Our scheme 2 suggests framework for richer tasks and is information theoretically secure rather than computationally secure. Fully homomorphic encryption In his seminal paper =-=[16]-=-, Craig Gentry presented the first fully homomorphic encryption (FHE) scheme which is capable of performing encrypted computation on Boolean circuits. A user specifies encrypted inputs to the program,... |

581 |
Safeguarding Cryptographic Keys,
- Blakley
- 1979
(Show Context)
Citation Context ...y, based on the common belief on the complexity of mathematical tasks such as factoring, or information theoretically secure which is unconditional secure, and usually based on secret sharing schemes =-=[28, 5]-=-. – The settings in which the scheme is described may differ, possibly assuming that participants use a synchronized network, that a secure and reliable broadcast channel exists, that a secure communi... |

283 |
Foundations of Cryptography: Volume 2, Basic Applications. Volume 2.
- Goldreich
- 2009
(Show Context)
Citation Context ...ipants, such that an adversary cannot tap-in, modify or generate messages in the channel, and alike. Secure multi-party computation can be realized in various settings for computing general functions =-=[21]-=-. However, the general scheme presented in [21] may be impractical due to efficiency reasons, partly due to the communication required among the participants. In [2], Ben-Or et al demonstrated that an... |

154 |
Secret sharing homomorphisms: Keeping shares of a secret secret.
- Benaloh
- 1987
(Show Context)
Citation Context ...t we address and compare our results with fully homomorphic encryption schemes. Multi-party computation Josh Cohen Benaloh describes the homomorphism property of Shamir’s linear secret sharing scheme =-=[3]-=-, with the help of communication to decrease the polynomial degree. Ronald Cramer et al. presented a method [7] for converting shares of a secret into shares of the same secret in a different secret-s... |

133 | Implementing Gentry's fullyhomomorphic encryption scheme,”
- Gentry, Halevi
- 2011
(Show Context)
Citation Context ...t gaining information concerning the input or the computation state. Following the outline of Gentry’s, many subsequent FHE schemes [17, 30, 6, 19] are proposed and some of which are even implemented =-=[18]-=-. Most recently, Craig Gentry et al. executed one AES-128 encryption homomorphically in eight days [20]. Most encrypted computation examples are restricted to fixed-iteration loops or Boolean circuits... |

117 | Secure Multiparty Computation Problems and Their Applications: A Review and Open Problems, in proceedings of new security paradigm workshop,
- Du, Atallah
- 2001
(Show Context)
Citation Context ...he inputs, correctness of the computation, and that no information is revealed to a participant in the computation beyond the information that can be inferred from that participants’ input and output =-=[22, 14]-=-. Like other cryptographic protocols, the security of MPC protocol can rely on different assumptions: – It can be computational, namely, based on the common belief on the complexity of mathematical ta... |

91 | Fully homomorphic encryption without bootstrapping.
- Brakerski, Gentry, et al.
- 2012
(Show Context)
Citation Context ... the program, and the server computes on the encrypted inputs without gaining information concerning the input or the computation state. Following the outline of Gentry’s, many subsequent FHE schemes =-=[17, 30, 6, 19]-=- are proposed and some of which are even implemented [18]. Most recently, Craig Gentry et al. executed one AES-128 encryption homomorphically in eight days [20]. Most encrypted computation examples ar... |

89 |
Multi-party computations: Past and present,”
- Goldwasser
- 1997
(Show Context)
Citation Context ...he inputs, correctness of the computation, and that no information is revealed to a participant in the computation beyond the information that can be inferred from that participants’ input and output =-=[22, 14]-=-. Like other cryptographic protocols, the security of MPC protocol can rely on different assumptions: – It can be computational, namely, based on the common belief on the complexity of mathematical ta... |

68 | Homomorphic evaluation of the aes circuit.
- Gentry, Halevi, et al.
- 2012
(Show Context)
Citation Context ... many subsequent FHE schemes [17, 30, 6, 19] are proposed and some of which are even implemented [18]. Most recently, Craig Gentry et al. executed one AES-128 encryption homomorphically in eight days =-=[20]-=-. Most encrypted computation examples are restricted to fixed-iteration loops or Boolean circuits, however, Fletcher et al. try to build a compiler for encrypted computation of general programs [15]. ... |

37 |
Shai Halevi, and Vinod Vaikuntanathan. Fully homomorphic encryption over the integers.
- Dijk, Gentry
- 2010
(Show Context)
Citation Context ... the program, and the server computes on the encrypted inputs without gaining information concerning the input or the computation state. Following the outline of Gentry’s, many subsequent FHE schemes =-=[17, 30, 6, 19]-=- are proposed and some of which are even implemented [18]. Most recently, Craig Gentry et al. executed one AES-128 encryption homomorphically in eight days [20]. Most encrypted computation examples ar... |

34 |
Toward basing fully homomorphic encryption on worst-case hardness.
- Gentry
- 2010
(Show Context)
Citation Context ... the program, and the server computes on the encrypted inputs without gaining information concerning the input or the computation state. Following the outline of Gentry’s, many subsequent FHE schemes =-=[17, 30, 6, 19]-=- are proposed and some of which are even implemented [18]. Most recently, Craig Gentry et al. executed one AES-128 encryption homomorphically in eight days [20]. Most encrypted computation examples ar... |

28 |
Skeith III, W.E.: Private Searching on Streaming Data
- Ostrovsky
- 2005
(Show Context)
Citation Context ... Although the authors can hide the current state of the FSA, the dealer must supply the input symbols in plain text to each participant. Secure computation on data stream Private stream searching. In =-=[26]-=-, Ostrovesky et al. defined the problem of private filtering where a data stream is searched for predefined keywords. The schemes are also implemented by Paillier homomorphic cryptosystem. The propose... |

26 | Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution.
- Huang, Katz, et al.
- 2012
(Show Context)
Citation Context ...an be computed with perfect security in the private channels model. For the main result of [2], Gilad Asharov and Yehuda Lindell gave a full proof in [1] in 2011. Recently, several fast MPC protocols =-=[23, 29, 24]-=- are proposed to meet a specified security level at a relative low cost, while they all based the security of their protocols on computational unproven hardness assumptions. According to the experimen... |

21 | Functional encryption for regular languages
- Waters
- 2012
(Show Context)
Citation Context ...ver a prime field to another field [8]. By using a pseudorandom function, they showed how to convert arbitrary many bit values from one initial random replicated share. Outsourcing finite automata In =-=[31]-=-, Brent Waters provides a functional encryption system that supports functionality for regular languages. In this system a secret key is associated with a deterministic finite automaton (DFA) M . A ci... |

20 | Efficient secure two-party computation using symmetric cut-and-choose.
- HUANG, KATZ, et al.
- 2013
(Show Context)
Citation Context ...an be computed with perfect security in the private channels model. For the main result of [2], Gilad Asharov and Yehuda Lindell gave a full proof in [1] in 2011. Recently, several fast MPC protocols =-=[23, 29, 24]-=- are proposed to meet a specified security level at a relative low cost, while they all based the security of their protocols on computational unproven hardness assumptions. According to the experimen... |

16 | A full proof of the bgw protocol for perfectly-secure multiparty computation
- Asharov, Lindell
- 2011
(Show Context)
Citation Context ...t al demonstrated that any n-party functionality can be computed with perfect security in the private channels model. For the main result of [2], Gilad Asharov and Yehuda Lindell gave a full proof in =-=[1]-=- in 2011. Recently, several fast MPC protocols [23, 29, 24] are proposed to meet a specified security level at a relative low cost, while they all based the security of their protocols on computationa... |

16 | New techniques for private stream searching,
- Bethencourt, Song, et al.
- 2009
(Show Context)
Citation Context ...iltering where a data stream is searched for predefined keywords. The schemes are also implemented by Paillier homomorphic cryptosystem. The proposed scheme was improved by John Bethencourt et al. in =-=[4]-=- reducing the communication and storage complexity. Our scheme 2 suggests framework for richer tasks and is information theoretically secure rather than computationally secure. Fully homomorphic encry... |

11 |
Yuval Ishai, Share conversion, pseudorandom secretsharing and applications to secure computation
- Cramer, Damg̊ard
(Show Context)
Citation Context ...hen Benaloh describes the homomorphism property of Shamir’s linear secret sharing scheme [3], with the help of communication to decrease the polynomial degree. Ronald Cramer et al. presented a method =-=[7]-=- 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. They showed how this can be co... |

8 |
Secret Swarm Unit. Reactive k-secret Sharing,”
- Dolev, Lahiani, et al.
- 2007
(Show Context)
Citation Context ...e schemes are based on unproven, commonly believed to be hard mathematical tasks and are not information theoretically secure. Perennial distributed computation on common inputs In 2007, Dolev et al. =-=[12, 13]-=- presented the settings for infinite private computation and presented few functions that can operate under a global input. Then in 2009, Dolev et al. [9] presented schemes that support infinite priva... |

4 |
Srinivas Devadas. Compilation techniques for efficient encrypted computation. Cryptology ePrint Archive, Report 2012/266
- Fletcher, Dijk
- 2012
(Show Context)
Citation Context ...s [20]. Most encrypted computation examples are restricted to fixed-iteration loops or Boolean circuits, however, Fletcher et al. try to build a compiler for encrypted computation of general programs =-=[15]-=-. Fletcher et al. also formally show how a Turing machine operation can be transformed into an arithmetic circuit that can be evaluated under encryption. The FHE schemes that follow the outline of Gen... |

3 |
Kolesnikov “Swarming Secrets
- Dolev, Garay
(Show Context)
Citation Context ...n on common inputs In 2007, Dolev et al. [12, 13] presented the settings for infinite private computation and presented few functions that can operate under a global input. Then in 2009, Dolev et al. =-=[9]-=- presented schemes that support infinite private computation among participants, implementing an oblivious universal Turing machine. At each single input of the machine, participants need to broadcast... |

2 |
and Shai Halevi. Fully homomorphic encryption without squashing using depth-3 arithmetic circuits
- Gentry
- 2011
(Show Context)
Citation Context |

2 | and Elwyn R Berlekamp. Error correction for algebraic block codes - Welch - 1986 |

1 |
and Rune Thorbek. Efficient conversion of secret-shared values between different fields
- Damgård
(Show Context)
Citation Context ...ndomness, any number of Shamir’s secret-shares of (pseudo)random values without communication. Damgard et al. showed how to effectively convert a secret-shared bit over a prime field to another field =-=[8]-=-. By using a pseudorandom function, they showed how to convert arbitrary many bit values from one initial random replicated share. Outsourcing finite automata In [31], Brent Waters provides a function... |

1 |
Niv Gilboa, and Vladimir Kolesnikov. Secret sharing krohn-rhodes: Private and perennial distributed computation
- Dolev, Garay
- 2011
(Show Context)
Citation Context ...tion in order to reduce the degree of the polynomial used to share secrets. Based on combination of secret-sharing techniques and the Krohn-Rhodes decomposition of finite state automata, Dolev et al. =-=[10]-=- proposed the first communicationless scheme for private and perennial distributed computation on common inputs in a privacy preserving manner, assuming that even if the entire memory contents of a su... |

1 |
Niv Gilboa, Vladimir Kolesnikov, and Yelena Yuditsky. Brief announcement: Efficient private distributed computation on unbounded input streams
- Dolev, Garay
- 2012
(Show Context)
Citation Context ...computational complexity of the algorithm of each participant is exponential in the automata number of states. Relying on the existence of one-way functions or common long one time pads, Dolev et al. =-=[11]-=- showed how to process a priori unbounded number of inputs for inputs over a finite state automaton (FSA) at a cost that is linear in the number of FSA states. Although the authors can hide the curren... |

1 |
Seyed Saeed Sadeghian, and Babak Sadeghiyan. An efficient protocol for oblivious dfa evaluation and applications
- PaymanMohassel
- 2012
(Show Context)
Citation Context ...sociated with his private key accepts the string w. Motivated by the need to outsource file storage to untrusted clouds while still permitting limited usage of that data by third parties, the work in =-=[25]-=- presented practical protocols by which a client (the third-party) can evaluate a DFA on an encrypted file stored at a server (the cloud), once authorized to do so by the file owner. All the above sch... |