
	Where results make sense

Topic: Secure multiparty computation

	Secure multiparty computation - Wikipedia, the free encyclopedia
		In cryptography, secure multiparty computation is a problem that was initially suggested by Andrew C. Yao in a 1982 paper.
		Secure multiparty computations are closely related to the problem of secret sharing, and more specifically verifiable secret sharing (VSS), every MPC protocol uses a VSS.
		Secure distributed CSP (DisCSP) solvers — a web-application with an applet-interpreter to design and run your own full-fledged secure multiparty computation (based on the SMC declarative language).
	en.wikipedia.org /wiki/Secure_multiparty_computation (467 words)

	Columbia Theory Reading Group, Spring 2003
		Secure multiparty computation allows mutually distrustful parties to compute a function of their inputs without revealing unnecessary information.
		Both secure multiparty computation and approximation algorithms are major research fields, and a rich body of work has emerged in the last decades in these two areas.
		This dual scheme is the first provably secure group-signature scheme whose signature size is not proportional to the size of the group and is based on a traditional assumption, namely the Decisional Diffie-Hellman (and a random oracle).
	www.cs.columbia.edu /theory/theoryabstracts.html (1209 words)

	On Protocol Security in the Cryptographic Model
		A general solution to the secure multiparty computation problem is a compiler which given any feasible function describes an efficient protocol which allows the parties to compute the function securely on their local inputs over an open network.
		Over the past twenty years the secure multiparty computation problem has been the subject of a large body of research, both research into the models of multiparty computation and research aimed at realizing general secure multiparty computation.
		The computation then starts by all parties broadcasting encryptions of their inputs and progresses through computing encryptions of the intermediary values using the homomorphic properties of the encryption scheme.
	www.brics.dk /DS/03/8 (716 words)

	Secure Multiparty Computation for Privacy Preserving Data Mining
		The aim of a secure multiparty computation task is for the participating parties to securely compute some function of their distributed and private inputs.
		Two central guiding principles in defining security are that: (a) the definition must accurately, and conservatively, model the real-world network setting and adversarial threat (this can differ per application and setting), and (b) all aspects of the model must be fully and explicitly defined.
		We therefore explicitly relax the security definition and allow the adversary to prevent the honest party from receiving its output, even in the ideal model; this relaxed definition is called security with abort.
	www.cs.biu.ac.il /~lindell/research-statements/mpc-ppdm.htm (3319 words)

	No title
		The main topic of this course is the study of secure multiparty computation protocols.
		The problem is easily modeled as a secure function computation, where the inputs are the shares of the key and the message to be signed, and the output is the signature.
		The second motivation we are interested in secure multiparty computation is that many traditional cryptographic tasks can be casted as general secure function computation problems.
	www-cse.ucsd.edu /classes/fa02/cse208/lec1.html (990 words)

	Secure Multiparty Computation of Approximations - Feigenbaum, Fong, Strauss, Wright (ResearchIndex) (Site not responding. Last check: 2007-10-08)
		Secure Multiparty Computation of Approximations - Feigenbaum, Fong, Strauss, Wright (ResearchIndex)
		26.4%: Secure Multiparty Computation of Approximations - Feigenbaum, Malkin, Nissim..
		165 Security and composition of multiparty cryptographic protoco..
	citeseer.ist.psu.edu /445271.html (698 words)

	Cryptography :: Web Articles ::
		A characteristic of computer ciphers is that they operate on binary strings, unlike classical and mechanical schemes, which use an alphabet of around 26 letters (depending on the language).
		Computer ciphers are also much more resistant to cryptanalysis; few are susceptible to a ciphertext-only attack.
		The security of all practical encryption schemes remains unproven, both for symmetric and asymmetric schemes.
	www.webarticles.com /Computers/Computer-Science/Cryptography (2271 words)

	UvT: Abstract Pim Tuyls (Site not responding. Last check: 2007-10-08)
		We present new results in the framework of secure multiparty computation based on homomorphic threshold cryptosystems.
		We also investigate private outputs for the general case and fairness for the case of two-party computation based on homomorphic threshold cryptosystems.
		In this talk, we mainly focus on a new application which we call "Secure Profile Matching" where two parties jointly test whether some function of their profiles exceeds a given threshold, without divulging any information on their profiles.
	www.uvt.nl /faculteiten/feb/nmc2004/tuyls (223 words)

	Cryptology ePrint Archive (Site not responding. Last check: 2007-10-08)
		Secure multiparty computation of $f$ allows the parties to compute $f$ without revealing more than they have to, but requires some additional overhead in computation and communication.
		A secure computation of $\fhat$ may be efficient enough, but a secure computation of $\fhat$ is not necessarily as private as a secure computation of $f$, because the output of $\fhat$ may reveal more information than the output of $f$.
		In this paper, we present definitions and protocols of secure multiparty approximate computation that show how to realize most of the cost savings available by using $\fhat$ instead of $f$ without losing the privacy of a secure computation of $f$.
	eprint.iacr.org /2000/030 (277 words)

	ipedia.com: Cryptography Article (Site not responding. Last check: 2007-10-08)
		Associated fields are steganography — the study of hiding the very existence of a message, and not necessarily the contents of the message itself (for example, microdots, or invisible ink) — and traffic analysis, which is the analysis of patterns of communication in order to learn secret information.
		While it should be easy to compute, it must be very difficult to invert (one-way), though other properties are usually needed as well.
		When the security of a system fails, it is rare that a weakness in the cryptographic algorithms is exploited.
	www.ipedia.com /cryptography_1.html (2240 words)

	SMC: Secure Multiparty Computation Language
		A Secure Multiparty Computation is a cryptographic protocol among a set of participants, where some of the inputs needed for the interaction have to be hidden from participants other than the initial owner.
		Secure Multiparty Computations are non-trivial to design, particularly because not any composition of such protocols remains secure.
		The contribution of this language and of the provided interpreter should be considered in the light of the fact that no other support for secure computations was present at the moment when this was written (no imperative languages and even no software libraries).
	www.cs.fit.edu /~msilaghi/SMC/tutorial.html (1655 words)

	Secure Multiparty Computation References
		In “distributed computing” a number of networked players carry out a joint computation of a function on their inputs.
		The aim of secure multiparty computation (or simply, multiparty computation), in contrast, is to enable players to carry out distributed computing tasks on their private information while under attack by an external entity (“the adversary”) and/or by a subset of malicious players (“the colluding players”).
		A secure protocol for key exchange is presented based on the computational difficulty of inverting the discrete logarithm function.
	privacy.cs.cmu.edu /dataprivacy/papers/multipartycomputation (852 words)

	Secure multiparty computation: Facts and details from Encyclopedia Topic (Site not responding. Last check: 2007-10-08)
		secure multiparty computation is a problem that was initially suggested by Andrew C, Exception Handler: No article summary found.
		An adversary can be static (chooses its victims before the start of the multiparty computation) or dynamic (can chose its victims during the course of execution of the multiparty computation), Exception Handler: No article summary found.
		Secure multiparty computations are closely related to the problem of secret sharing[for more info, click this link], Exception Handler: No article summary found.
	www.absoluteastronomy.com /ref/secure_multiparty_computation (761 words)

	Venky's Research Page (Site not responding. Last check: 2007-10-08)
		Current interests range from Cryptographic Techniques to Secure Function Evaluation that is used in Secure Multiparty Computation involving a number of agents, to arrive at a secret between a subset of agents involved in the computation.
		Usually in Secure Multiparty Computation, the homomorphic properties of public-key cryptosystems is exploited.
		Secure Multiparty Computation involves Secure evaluation of functions involving public and secret elements in a distributed environment.
	my.fit.edu /~vramamoo/research/research.html (544 words)

	No title
		These inputs correspond to intermediate computations of protocol f, and the security definition of f only allows to substitute the initial input to f, but not intermediate messages, which would affect the correctness of the protocol.
		It follows from the security of the commitment scheme, and the privacy of the original protocol, that the output of the ideal adversary (joint with y[2]) is indistinguishable from the real attack.
		The above proof immediately achieves this notion of security, with the ideal adversary aborting the protocol as soon as A contributes a malformed input to the authenticated computation protocol.
	www-cse.ucsd.edu /classes/fa02/cse208/lec11.html (1156 words)

	COMS E6998-2: Topics in CS: Advanced Cryptography (Site not responding. Last check: 2007-10-08)
		Informally, these are general protocols among two or more parties, where all parties want to maintain the privacy of their inputs and prevent other parties from disrupting the correct execution of the computation (for example, think of voting protocols, auctions, computing the average salary of the participants, playing fl jack, etc.).
		Indeed, secure computation can be viewed as encompassing, in some sense, every other cryptographic task as a special case, and general plausibility results (protocols for secure computation of any functionality) are among the most important results in cryptography.
		Cryptography and Information Security Group in the Laboratory for Computer Science at MIT, and received her Ph.D. in February 2000.
	www.cvn.columbia.edu /courses/Spring2004/COMSE6998-2.html (1296 words)

	Secure Multiparty Computation of Approximations - Feigenbaum, Fong, Strauss, Wright (ResearchIndex)
		In particular, approximations are often useful in a distributed setting where the inputs are held by different parties and are extremely large.
		Furthermore, for some applications, the parties want to cooperate to compute a function of their inputs without revealing more information than necessary.
		52.0%: Secure Multiparty Computation of Approximations - Feigenbaum, Malkin, Nissim..
	citeseer.ist.psu.edu /448653.html (676 words)

	APPLIED CRYPTOGRAPHY, SECOND EDITION: Protocols, Algorithms, and Source Code in C:Esoteric Protocols (Site not responding. Last check: 2007-10-08)
		If Bob were a computer program that blindly executed the protocol, Alice could learn his age (is the age of a computer program the length of time since it was written or the length of time since it started running?) by repeatedly executing the protocol.
		This is another problem for secure multiparty computation [1373]: A council of seven meets regularly to cast secret ballots on certain issues.
		The general problem of secure multiparty computation is also called secure circuit evaluation.
	friedo.szm.sk /krypto/AC/ch06/06-05.html (886 words)

	[No title] (Site not responding. Last check: 2007-10-08)
		If $\hat{f}$ is an approximation to $f$, secure multiparty computation of $\hat{f}$ allows the parties to compute $\hat{f}$ without revealing unnecessary information.
		However, secure computation of $\hat{f}$ may not be as private as secure computation of $f$, because the output of $\hat{f}$ may itself reveal more information than the output of $f$.
		In this paper, we present definitions of secure multiparty approximate computations that retain the privacy of a secure computation of $f$.
	wisdom.weizmann.ac.il /mathusers/kobbi/papers/priv_approx_abstract.html (166 words)

	Oblivious transfer - Wikipedia, the free encyclopedia
		Like much of modern cryptography, the feasibility of such a protocol in practice is dependent on assumptions about computational difficulty, such as the existence of trapdoor permutations.
		In general, the assumptions that need to be made are strong enough that oblivious transfer is a sufficient primitive to enable general secure multiparty computation.
		Therefore, oblivious transfer is a fundamental cryptographic primitive and forms the basis for many cryptographic protocols.
	en.wikipedia.org /wiki/Oblivious_transfer (272 words)

	Announcements (Site not responding. Last check: 2007-10-08)
		WORKSHOP ON SECURE MULTIPARTY PROTOCOLS (SMP 2004) Announcement and Call for Contributions October 7-8, 2004, Amsterdam, The Netherlands http://www.zurich.ibm.com/~cca/smp2004/ The workshop is organized by ECRYPT, the European Network of Excellence in Cryptology, and in connection with DISC 2004, the 18th Annual Conference on Distributed Computing, which takes place October 5-7, in Amsterdam.
		Secure protocols must reach their goals despite attacks from agents who participate in the protocol.
		The aim of this workshop is to bring together researchers and practitioners from the cryptography and distributed computing areas, from academia and industry, who are working on secure multiparty protocols for distributed systems, in order to engage in a discussion about common goals and important research problems in the overlap of the areas.
	www.iacr.org /newsletter/v21n2/announce.html (1319 words)

	Secure Computation Without Authentication (Site not responding. Last check: 2007-10-08)
		In the setting of secure multiparty computation, a set of parties wish to jointly compute some function of their inputs.
		Such a computation must preserve certain security properties, like privacy and correctness, even if some of the participating parties or an external adversary collude to attack the honest parties.
		In particular, we define a relaxed notion of what it means to ``securely compute'' a function in the unauthenticated setting.
	www.cs.biu.ac.il /~lindell/abstracts/unauth-mpc_abs.html (252 words)

	Unenumerated: Multiparty secure computation (Site not responding. Last check: 2007-10-08)
		The computation could be as simple as comparing ages or as complex as an audit or an auction.
		In this shared computation, the inputs are mutually private, the output shared with all participants, and the privacy of the inputs does not depend on a trusted third party.
		He holds a bachelor's degree in computer science from the University of Washington, and has substantial experience in the areas of Internet security, e-commerce, and software engineering.
	unenumerated.blogspot.com /2006/01/multiparty-secure-computation.html (297 words)

	Secure Multi-Party Computation (ResearchIndex) (Site not responding. Last check: 2007-10-08)
		0.2: Adaptively Secure Multi-party Computation - Canetti, Feige, Goldreich, Naor (1995)
		159 Security and Composition of Multi-party Cryptographic Protoc..
		87 the Security of Public-Key Protocols (context) - Dolev, Yao - 1983
	citeseer.ifi.unizh.ch /696636.html (764 words)

	Communication vs. Computation (ResearchIndex) (Site not responding. Last check: 2007-10-08)
		The fundamental question we investigate is the following: Is there a computational task that exhibits a strong tradeo# behavior between the amount of communication and the amount of time needed for local computation?
		0.3: Secure Multiparty Computation of Approximations - Feigenbaum, Ishai, Malkin..
		Secure Multiparty Computation of Approximations - Feigenbaum, Ishai, Malkin..
	sherry.ifi.unizh.ch /639999.html (398 words)

	Incoercible Multiparty Computation (Extended Abstract) (ResearchIndex) (Site not responding. Last check: 2007-10-08)
		In this work we present the first general treatment of the coercion problem in secure computation.
		0.1: Adaptively Secure Multi-party Computation - Canetti, Feige, Goldreich, Naor (1995)
		0.6: Secure Multiparty Computation of Approximations - Feigenbaum, Ishai, Malkin..
	citeseer.ifi.unizh.ch /457028.html (368 words)

	Computer Science, Rutgers University: Extensible Software Systems: Implementation, Languages and Theorems (Site not responding. Last check: 2007-10-08)
		I will first talk briefly about secure multiparty computation of approximations, which combine the efficiency advantages of an approximate computation with the privacy of a secure multiparty computation.
		I will then focus on quorum systems, which are a general and useful tool for providing efficient and fault tolerant replicated data: In a setting of replicated variables held by distributed servers, quorum systems provide efficient fault-tolerance by allowing operations to be performed at only a subset (quorum) of servers.
		This allows the system to operate in an efficient low-threshold mode with relatively small quorums in the absence of faults, increasing and decreasing the fault tolerance as faults appear and are dealt with respectively.
	www.cs.rutgers.edu /pub/colloquia/04.15.02.html (228 words)

	Secure Multi-Party Computation
		We show that whatever can be computed in this ideal scenario can be computed in a secure manner when no such trusted party exists.
		Further results (as time permits) will include: Secure computation in partial communication networks; The communication and round complexity of private protocols; and a survey of the known results on asynchronous secure computation.
		Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority.
	www.brics.dk /BRICS/Activities/95/SecMultComp/SecMultComp.html (621 words)

Try your search on: Qwika (all wikis)