Download:
by Keith Frikken, Mikhail Atallah
http://www.ifca.ai/fc05/p22.pdf
Add To MetaCart
Abstract:
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has certain constraints on the acceptability and desirability (i.e., a private “utility ” function) of each clause. If Bob were to reveal his constraints to Alice in order to find an agreement, then she would learn an unacceptable amount of information about his business operations or strategy. To alleviate this problem we propose the use of Secure Function Evaluation (SFE) to find an agreement between the two parties. There are two parts to this: i) determining whether an agreement is possible (if not then no other information should be revealed), and ii) in case an agreement is possible, coming up with a contract that is valid (acceptable to both parties), fair (when many valid and good outcomes are possible one of them is selected randomly with a uniform distribution, without either party being able to control the outcome), and efficient (no clause is replaceable by another that is better for both parties). It is the fairness constraint in (ii) that is the centerpiece of this paper as it requires novel techniques that produce a solution that is more efficient than general SFE techniques. We give protocols for all of the above in the semi-honest model, and we do not assume the Random Oracle Model. 1
Citations
|
524
|
Applied Cryptography: Protocols, Algorithms and Source Code in C
– Schneier
- 1995
|
|
494
|
Completeness theorems for non-cryptographic fault-tolerant distributed computation
– Ben-Or, Goldwasser, et al.
- 1988
|
|
393
|
Communication Complexity
– Kushilevitz, Nisan
- 1997
|
|
316
|
Multiparty unconditionally secure protocols
– Chaum, Crepeau, et al.
- 1988
|
|
283
|
Protocols for secure computation
– Yao
- 1982
|
|
276
|
Security and composition of multiparty cryptographic protocols
– Canetti
- 2000
|
|
273
|
How to play any mental game
– Goldreich, Micali, et al.
- 1987
|
|
272
|
Public-key cryptosystems based on composite residuosity classes
– Paillier
- 1999
|
|
146
|
Oblivious transfer and polynomial evaluation
– Naor, Pinkas
|
|
109
|
Limits on the provable consequences of one-way permutations
– Impagliazzo, Rudich
- 1989
|
|
89
|
Secure Multi-party Computation (working draft) version 1.1, 1198. Available at http://philby.ucsd.edu/books.html
– Goldreich
|
|
86
|
Efficient private matching and set intersection
– Freedman, Nissim, et al.
- 2004
|
|
60
|
Efficient oblivious transfer protocols
– Naor, Pinkas
- 2001
|
|
55
|
A declarative approach to business rules in contracts: Courteous logic programs in XML
– Grosof, Labrou, et al.
- 1999
|
|
48
|
Multi party computations: past and present
– Goldwasser
- 1997
|
|
46
|
A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system
– Damg˚ard, Jurik
|
|
39
|
Fairplay — A secure two-party computation system
– Malkhi, Nisan, et al.
- 2004
|
|
34
|
Foundations of Cryptography: Volume II: Basic Applications
– Goldreich
- 2004
|
|
24
|
Amit Sahai. Universally composable two-party and multi-party secure computation
– Canetti, Lindell, et al.
- 2002
|
|
19
|
Round-optimal secure two-party computation
– Katz, Ostrovsky
- 2004
|
|
18
|
to generate and exchange secrets
– How
- 1986
|
|
17
|
Foundations of Cryptography, volume Basic Tools
– Goldreich
- 2001
|
|
11
|
Cryptography and Cryptographic Protocols
– Goldreich
- 2003
|
|
9
|
EPOC: Efficient probabilistic publickey encryption
– Okamoto, Uchiyama, et al.
- 1998
|
|
5
|
Privacy preserving route planning
– Frikken, Atallah
- 2004
|
|
2
|
ter Hofstede, and Phillipa Oaks. Defeasible logic for automated negotiation
– Governatori, Arthur
- 2000
|
|
2
|
Preserving privacy when preference searching in e-commerce
– Smith, Shao
- 2003
|
|
1
|
Intention and agreement spaces - a formalism
– Strbel
|
