We introduce a new paradigm for the efficient de- sign of protocols for secure joint computation requiring minimal interaction.Instead of relying on trusted and specialized devices, unproven cryptographic assumptions, or highly interactive multiparty computations, we propose a commoditybased model in which servers provide security resources to clients but are not involved in the clients' computations themselves.Unlike oracles, which typically provide comput ational resources such as the resnlts of infeasible computations, these servers assist clients in establishing shared resources for secure computations such as oblivious transfer and circuit evaluation, broadcast and multiparty computations.Unlike protocols for secure multiparty computation, the servers themselves are "non-interactive," having no knowledge whatsoever of each other, and providing security resources in a single message.This approach to secure interactive computing obviates the need for unproven cryptographic assumptions, special hardware (such as oblivious transfer channels), completely-connected networks, or global knowledge and synchronization.It gracefully accommodates expansion without introducing bottlenecks (even polynomial) at larger scales.We give explicit constructions supporting oblivious transfer and network multicast.

Article Free Access Share on Correlated pseudorandomness and the complexity of private computations Author: Donald Beaver Transarc Corp., Gulf Tower, 707 Grant St., Pittsburgh, PA Transarc Corp., Gulf Tower, 707 Grant St., Pittsburgh, PAView Profile Authors Info & Claims STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of ComputingJuly 1996 Pages 479–488https://doi.org/10.1145/237814.237996Online:01 July 1996Publication History 125citation730DownloadsMetricsTotal Citations125Total Downloads730Last 12 Months64Last 6 weeks17 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

In a network of n players, each player i having private input zi, we show how the players can collaboratively evaluate a function f(zl, ..., zn) in a way that does not compromise the privacy of the players' inputs, and yet requires only a constant number of rounds of interaction.The underlying model of computation is a complete network of private channels, with broadcast, and a majority of the players must behave honestly.Our solution assumes the existence of a one-way function.share bi to player i.For some parameter t, t < n/2, we require that no t players get information about b from their pieces; and yet, b is recoverable, and is known to be recoverable, given the cooperation of the n -t good players--even if the t bad players try to obstruct b's recovery, or try to alter the recovered value.The value b which a player has effectively "committed to" is independent of the values that honest players may concurrently be committing to.After the sharing stage, a computation stage follows, in which each player, given his own shares of xl, ..., x,~, computes his own share of f(zt,..., z,~).To accomplish this, the function f to be evaluated is represented by a

The problem of performing a multiparty computation when more than half of the processors are cooperating Byzantine faults is addressed. It is shown how to compute any Boolean function of n inputs distributively, preserving the privacy of inputs held by nonfaulty processors and ensuring that faulty processors obtain the function value if and only if the nonfaulty processors do. If the nonfaulty processors do not obtain the correct function value, they detect cheating with high probability. The solution is based on a new type of verifiable secret sharing in which the secret is revealed not all at once but in small increments. This process ensures that all processors discover the secret at roughly the same time. The solution assumes the existence of an oblivious transfer protocol and uses broadcast channels. The processors are not required to have equal computing power.>

Article Non-cryptographic fault-tolerant computing in constant number of rounds of interaction Share on Authors: J. Bar-Ilan Hebrew University Hebrew UniversityView Profile , D. Beaver Harvard University Harvard UniversityView Profile Authors Info & Claims PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computingJune 1989 Pages 201–209https://doi.org/10.1145/72981.72995Online:01 June 1989Publication History 163citation1,190DownloadsMetricsTotal Citations163Total Downloads1,190Last 12 Months94Last 6 weeks18 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access