Marius-Calin Silaghi  Home/Search
Context Related
| iacr.org/2004/333.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2004/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Secure simulations of arithmetic circuit and boolean circuit evaluations are known to save privacy while providing solutions to any probabilistic function over a field. The problem we want to solve is to select a random solution of a general combinatorial problem. Here we discuss how to specify the need of selecting a random solution of a general combinatorial problem, as a probabilistic function. Arithmetic circuits for finding the set of all solutions are simple to design [24]. (Update)
Cited by: More
Zero-Knowledge Proofs for Mix-nets of Secret Shares.. - Marius-Calin Silaghi.. (2005) (Correct)
Active bibliography (related documents): More All
1.9: Private and Efficient Stable Marriages (Matching) - Atkinson, Bartak, Silaghi.. (2006) (Correct)
0.7: The effect of policies for selecting the solution of a.. - Silaghi, Rajeshirke (2004) (Correct)
0.6: Bumping Strategies for the Multiagent Agreement Problem - Modi, Veloso (2005) (Correct)
Similar documents based on text: More All
0.1: On 2-Round Secure Multiparty Computation - Gennaro, Ishai, Kushilevitz, Rabin (2002) (Correct)
0.1: Simplified VSS and Fast-track Multiparty Computations with .. - Gennaro, Rabin, Rabin (1998) (Correct)
0.1: Studies in Secure Multiparty Computation and Applications - Canetti (1996) (Correct)
BibTeX entry: (Update)
Marius C. Silaghi. Secure multi-party computation for selecting a solution according to a uniform distribution over all solutions of a general combinatorial problem. Cryptology e-print Archive 2004/333, 2004. http://citeseer.ist.psu.edu/silaghi04secure.html More
@misc{ silaghi04secure,
author = "M. Silaghi",
title = "Secure multi-party computation for selecting a solution according to a
uniform distribution over all solutions of a general combinatorial problem",
text = "Marius C. Silaghi. Secure multi-party computation for selecting a solution
according to a uniform distribution over all solutions of a general combinatorial
problem. Cryptology e-print Archive 2004/333, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/silaghi04secure.html" }
Citations (may not include all citations):4212 Computers and Intractability - A Guide to the Theory of NPCo.. (context) - Garey, Johnson - 1979
702 Consistency in networks of relations (context) - Mackworth - 1977
645 How to share a secret (context) - Shamir - 1979
329 Untraceable electronic mail (context) - Chaum - 1981
307 Networks of constraints: Fundamental properties and applicat.. (context) - Montanari - 1974
185 A sufficient condition for backtrackfree search (context) - Freuder - 1982
177 Completeness theorems for non-cryptographic faulttolerant di.. (context) - Ben-Or, Goldwasser et al. - 1988
167 Protocols for secure computations (context) - Yao - 1982
162 Public-key cryptosystems based on composite degree residuosi.. - Paillier - 1999
110 Proofs that yield nothing but their validity and a methodolo.. (context) - Goldreich, Micali et al. - 1986
100 Founding cryptography on oblivious transfer (context) - Kilian - 1988
91 Belief maintenance in dynamic constraint networks (context) - Dechter, Dechter - 1988
52 Foundations of Cryptography - Goldreich - 2004
52 Multiparty computations ensuring privacy of each party's inp.. (context) - Chaum, Damgard et al. - 1988
52 Distributed constrained heuristic search (context) - Sycara, Roth et al. - 1991
52 Multistage negotiation for distributed constraint satisfacti.. (context) - Conry, Kuwabara et al. - 1991
45 General secure multi-party computation from any linear secre.. - Cramer, Damgrd et al. - 2000
34 Cryptographic computation: Secure fault-tolerant protocols a.. (context) - Galil, Haber et al. - 1988
32 Multiparty computation from threshold homomorphic encryption - Cramer, Damgrd et al. - 2001
24 A formal study of distributed meeting scheduling - Sen, Durfee - 1998
24 the feasibility of distributed constraint satisfaction - Collin, Dechter et al. - 1991
19 Parallel and distributed algorithms for finite constraint sa.. (context) - Zhang, Mackworth - 1991
16 Exploiting problem structure for distributed constraint opti.. - Liu, Sycara - 1995
11 Distributed dynamic backtracking (context) - Bessiere, Maestre et al. - 2001
10 Multi-agent oriented constraint satisfaction (context) - Liu, Jing et al. - 2002
10 Multi-party Cryptographic Computation: Techniques and Applic.. (context) - Haber - 1988
9 Secure distributed constraint satisfaction: Reaching agreeme.. (context) - Yokoo, Suzuki et al. - 2002
9 Secure distributed constraint satisfaction: Reaching agreeme.. (context) - Yokoo, Suzuki et al. - 2002
7 retrospective view FAC distributed problem solving - view, distributed et al. - 1991
7 Cryptographic Protocols (context) - Merritt - 1983
6 Secure multi-party quantum computation - Crepeau, Gottesman et al. - 2002
5 Secure multi-party computation made simple - Maurer - 2000
5 Optimal distributed arc-consistency - Hamadi - 1999
5 chapter Understanding line drawings of scenes with shadows (context) - Waltz, of - 1975
4 Distributed forward checking (context) - Meseguer, Jimenez - 2000
4 Privacy /efficiency tradeoffs in distributed meeting schedul.. (context) - Freuder, Minca et al. - 2001
3 Modeling complexity in secure distributed computing - Cachin - 2003
3 A simple protocol for secure circuit evaluation (context) - Abadi, Feigenbaum - 1988
2 On securely scheduling a meeting - Herlea, Claessens et al. - 2001
2 Incentive compatible open constraint optimization (context) - Faltings - 2003
2 Incentive auctions and stable marriages problems solved with.. (context) - Silaghi - 2004
1 Arithmetic circuit for the first solution of distributed CSP.. (context) - Silaghi - 2003
1 Characterizing the bahavior of a multi-agent search by using.. (context) - Zhou, Choueiry - 2003
1 chapter Constraint-Directed Negotiations of Resource Realloc.. (context) - Sathi, Fox et al. - 1989
1 Distributed knowledge based search (context) - Denzinger - 2001
1 Meeting scheduling with privacy (context) - Silaghi, Rajeshirke et al. - 2004
1 the complexity of verifiable secret sharing and multiparty c.. (context) - Dziembowski - 2000
Documents on the same site (http://eprint.iacr.org/2004/): More
The Security and Efficiency of Micciancio's Cryptosystem - Ludwig (2004) (Correct)
Entropic Security and the Encryption of High Entropy Messages - Dodis, Smith (2004) (Correct)
On Cheating Immune Secret Sharing - Braeken, Nikova, al. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC