172 Hits in 3.1 sec

Exclusion-Freeness in Multi-party Exchange Protocols [chapter]

Nicolás González-Deleito, Olivier Markowitch
2002 Lecture Notes in Computer Science  
In this paper we define a property for multi-party protocols called exclusion-freeness.  ...  Finally, we propose a new multi-party fair exchange protocol with an online trusted third party respecting the strong exclusion-freeness property.  ...  Our aim is to introduce a property devoted to multi-party protocols called exclusion-freeness. We illustrate it in the framework of an existing multi-party fair exchange protocol with an online TTP.  ... 
doi:10.1007/3-540-45811-5_15 fatcat:3yoz4khpcbeafg7dkv2def6hp4

On Fairness in Exchange Protocols [chapter]

Olivier Markowitch, Dieter Gollmann, Steve Kremer
2003 Lecture Notes in Computer Science  
The aim of this paper is to give an overview of the most classical definitions of fairness in exchange protocols.  ...  We propose a structured and generalized definition of fairness and of the security of exchange protocols.  ...  We also note that two-party fair exchange protocols and multi-party fair exchange protocols have often different fairness definitions (partially due to different topologies used in the multi-party case  ... 
doi:10.1007/3-540-36552-4_31 fatcat:nee2ohkvkfdkjbdzzsyqr7kcau

Exclusions and related trust relationships in multi-party fair exchange protocols

Nicolás González-Deleito, Olivier Markowitch
2007 Electronic Commerce Research and Applications  
In this paper we define the properties related to exchange protocols and exclusions, study exclusion scenarios on two wellknown multi-party fair exchange protocols and point out the implications that exclusions  ...  Two new protocols more robust than existing multi-party fair exchange protocols are therefore proposed.  ...  When more than two parties take part in an exchange protocol, the protocol is said to be multi-party.  ... 
doi:10.1016/j.elerap.2006.08.004 fatcat:h2pcvirivbfe7hedu7ukwukegu

Santosh Bharadwaj Rangavajjula, Tristan Claverie
2017 International Journal of Information Technology and Computer Science  
Multi-party contract signing (MPCS) is a way for signers to agree on a predetermined contract by exchanging their signature. This matter has become crucial with the growing number of communications.  ...  In this paper, we focus mainly on studying the state of the art protocols and more specifically the cryptography involved.  ...  It has been introduced in order to produce an optimistic fair exchange protocol, MPCS proto-cols being a subfield of the broader fair exchange problem.  ... 
doi:10.5815/ijitcs.2017.05.02 fatcat:jiz5chx5avazhdwtkqc4w2yfhq

Multiparty nonrepudiation

Jose A. Onieva, Jianying Zhou, Javier Lopez
2008 ACM Computing Surveys  
Finally it discusses the advanced solutions for two typical multi-party non-repudiation applications, i.e., multi-party certified email and multi-party contract signing. Evidence Transfer.  ...  After that, it presents in more detail the 1-N multi-party non-repudiation solutions for distribution of different messages to multiple recipients.  ...  Markowitch tackles the exclusion-freeness property in multi-party fair exchange protocols one year later in [González-Deleito and Markowitch 2002] .  ... 
doi:10.1145/1456650.1456655 fatcat:ygzho6mlevdjpagztwgvezv5r4

Self-tallying Elections and Perfect Ballot Secrecy [chapter]

Aggelos Kiayias, Moti Yung
2002 Lecture Notes in Computer Science  
Finally, (3) Dispute-freeness, suggests that disputes between active parties are prevented altogether, which is an important efficient integrity component.  ...  Strong voter privacy, although an important property of an election scheme, is usually compromised in election protocol design in favor of other (desirable) properties.  ...  We note here that these two corrective phases, are not exclusive and both can be implemented in a single execution of a protocol.  ... 
doi:10.1007/3-540-45664-3_10 fatcat:rruhqfrjcbatvmh377ena462cu

Non-repudiation protocols for multiple entities

Jose A. Onieva, Jianying Zhou, Javier Lopez
2004 Computer Communications  
We further propose an optimistic multi-party nonrepudiation protocol for exchange of different messages.  ...  We extend an existing multi-party non-repudiation (MPNR) protocol to allow an originator to send different messages to many recipients in a single transaction.  ...  Furthermore, some properties studied in multi-party fair exchange protocols such as exclusion freeness [5] are not applicable for non-repudiation protocols.  ... 
doi:10.1016/j.comcom.2004.06.003 fatcat:ydvqoxcmnrc5fnv5hpgjvuyjt4

Symbolically analyzing security protocols using tamarin

David Basin, Cas Cremers, Jannik Dreier, Ralf Sasse
2017 ACM SIGLOG News  
In particular we provided the first automated proof of receipt-freeness for this protocol. Electronic Payment Protocols. Cortier et al.  ...  For example in the case of fair exchange protocols, one can study timeliness and fairness [Backes et al. 2017 ].  ... 
doi:10.1145/3157831.3157835 fatcat:au2tz4fvajfm7p4yeyqlwj6aeq

Negotiation criteria for multiagent resource allocation

Karthik Iyer, Michael N. Huhns
2009 Knowledge engineering review (Print)  
The allocation category contains criteria concerning fairness and envy-freeness with respect to how resources are allocated to agents.  ...  Negotiation in a multiagent system is a topic of active interest for enabling the allocation of scarce resources among autonomous agents.  ...  Their detailed comments on each aspect of the paper helped us in presenting this material in a clear and succinct manner.  ... 
doi:10.1017/s0269888909000204 fatcat:wz64tq5l3vhyrl7mdmjjwgcsjm

Privacy and verifiability in voting systems: Methods, developments and trends

Hugo Jonker, Sjouke Mauw, Jun Pang
2013 Computer Science Review  
As more and more refined voting systems were proposed, understanding of first privacy and later verifiability in voting increased, and notions of privacy as well as notions of verifiability in voting became  ...  This has culminated in a variety of verifiable systems that use cryptographic primitives to ensure specific kinds of privacy.  ...  In addition, we are grateful for comments on early drafts of this work by Peter Y. A.  ... 
doi:10.1016/j.cosrev.2013.08.002 fatcat:fjqritngvnej3owtqnmhbuckqa

Collusion-Preserving Computation [chapter]

Joël Alwen, Jonathan Katz, Ueli Maurer, Vassilis Zikas
2012 Lecture Notes in Computer Science  
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate "any information beyond what the protocol allows".  ...  (This property is not implied by collusion-freeness.) • To provide a definition supporting composition, so that protocols can be designed in a modular fashion using sub-protocols run among subsets of the  ...  LetḠ be a setup, R and F be n-party resources, π be a {Ḡ, R}-exclusive protocol and φ be a {Ḡ, F}-exclusive protocol (both n-party protocols).  ... 
doi:10.1007/978-3-642-32009-5_9 fatcat:25h2cbfo3jfsnmkypp7zck4qtu

Life After BPEL? [chapter]

W. M. P. van der Aalst, M. Dumas, A. H. M. ter Hofstede, N. Russell, H. M. W. Verbeek, P. Wohed
2005 Lecture Notes in Computer Science  
Business protocols, in contrast, use process descriptions that specify the mutually visible message exchange behavior of each of the parties involved in the protocol, without revealing their internal behavior  ...  An abstract, (not executable) process is a business protocol, specifying the message exchange behavior between different parties without revealing the internal behavior for any one of them.  ... 
doi:10.1007/11549970_4 fatcat:mr54lgd6jvguji5a5fnfr7yi7e

Accurate and large-scale privacy-preserving data mining using the election paradigm

Emmanouil Magkos, Manolis Maragoudakis, Vassilis Chrissikopoulos, Stefanos Gritzalis
2009 Data & Knowledge Engineering  
More specifically, our framework is based on the classical homomorphic election model, and particularly on an extension for supporting multi-candidate elections.  ...  In this paper we discuss the design and security requirements for large-scale privacypreserving data mining (PPDM) systems in a fully distributed setting, where each client possesses its own records of  ...  As mentioned in the RI forest protocol, each party encrypted its Partial Set and sent in to the Data Miner.  ... 
doi:10.1016/j.datak.2009.06.003 fatcat:trgjozgrvrhffo73e55n7ex7vy

A Survey on Efforts to Evolve the Control Plane of Inter-Domain Routing

Walber Silva, Djamel Sadok
2018 Information  
The BGP was introduced in the early stages of the Internet, and although the BGP is one of the most successful protocols, new desirable features have been difficult to incorporate into the network over  ...  The Internet's default inter-domain routing protocol is the Border Gateway Protocol (BGP).  ...  paths in concurrence without compromising loop-freeness.  ... 
doi:10.3390/info9050125 fatcat:4jrfkl4flrd2rmjxce3uutx5py

Privacy-Enhanced Event Scheduling

Benjamin Kellermann, Rainer Bohme
2009 2009 International Conference on Computational Science and Engineering  
Protocols to enable dynamic joining and leaving of participants are given.  ...  Based on superposed sending and Diffie-Hellman key agreement, it is designed to be efficient enough for practical implementations while requiring minimal trust in a central entity.  ...  Dynamic inclusion and exclusion of voters will be discussed in Sects. V-C and V-D.  ... 
doi:10.1109/cse.2009.270 dblp:conf/cse/KellermannB09 fatcat:i7sfvjagf5edxneax35menfux4
« Previous Showing results 1 — 15 out of 172 results