solving fair exchange with mobile agents
play

Solving Fair Exchange with Mobile Agents Henning Pagnia Holger Vogt - PowerPoint PPT Presentation

1 Solving Fair Exchange with Mobile Agents Henning Pagnia Holger Vogt Felix G artner Darmstadt University of Technology, Germany { pagnia|holgervo|felix } @informatik.tu-darmstadt.de Uwe G. Wilhelm Swiss Federal Institute of Technology,


  1. 1 Solving Fair Exchange with Mobile Agents Henning Pagnia Holger Vogt Felix G¨ artner Darmstadt University of Technology, Germany { pagnia|holgervo|felix } @informatik.tu-darmstadt.de Uwe G. Wilhelm Swiss Federal Institute of Technology, Lausanne, Switzerland Uwe.Wilhelm@epfl.ch

  2. 1 Solving Fair Exchange with Mobile Agents Henning Pagnia Holger Vogt Felix G¨ artner Darmstadt University of Technology, Germany { pagnia|holgervo|felix } @informatik.tu-darmstadt.de Uwe G. Wilhelm Swiss Federal Institute of Technology, Lausanne, Switzerland Uwe.Wilhelm@epfl.ch

  3. 2 Mobile agents and fair exchange • Autonomous agents roam the web and perform electronic business transactions on behalf of the user. • Items (goods, payment) must be exchanged in a fair manner. • Fair exchange problem = how to exchange items between two parties without either party suffering a disadvantage. • Our contribution: three increasingly flexible solutions to the problem using mobile agents.

  4. 3 What’s the problem with fair exchange? • An “unfair” exchange protocol: $ 1. Agent enters vendor’s host. 2. Agent receives audio file. 3. Agent pays electronically. audio file 4. Agent leaves host. electronic money $

  5. 3 What’s the problem with fair exchange? • An “unfair” exchange protocol: 1. Agent enters vendor’s host. $ 2. Agent receives audio file. 3. Agent pays electronically. audio file 4. Agent leaves host. electronic money $

  6. 3 What’s the problem with fair exchange? • An “unfair” exchange protocol: 1. Agent enters vendor’s host. $ 2. Agent receives audio file. 3. Agent pays electronically. audio file 4. Agent leaves host. electronic money $

  7. 3 What’s the problem with fair exchange? $ • An “unfair” exchange protocol: 1. Agent enters vendor’s host. 2. Agent receives audio file. 3. Agent pays electronically. audio file 4. Agent leaves host. electronic money $

  8. 3 What’s the problem with fair exchange? $ • An “unfair” exchange protocol: 1. Agent enters vendor’s host. 2. Agent receives audio file. 3. Agent pays electronically. audio file 4. Agent leaves host. electronic money $ • Visiting agent can run without paying (after step 2). • Vendor can kidnap agent (after step 3).

  9. 4 Solution 1: locked room • Locked room protocol: 1. Agents enter. 2. Doors close, agents swap. 3. Agents check and commit. 4. Doors open, agents leave. • Ensure that no information leaves the room! • Ensure that agents are destroyed if one does not commit!

  10. 4 Solution 1: locked room • Locked room protocol: 1. Agents enter. 2. Doors close, agents swap. a 3. Agents check and commit. A b 4. Doors open, agents leave. B • Ensure that no information leaves the room! • Ensure that agents are destroyed if one does not commit!

  11. 4 Solution 1: locked room • Locked room protocol: 1. Agents enter. 2. Doors close, agents swap. 3. Agents check and commit. 4. Doors open, agents leave. A a • Ensure that no information b leaves the room! B • Ensure that agents are destroyed if one does not commit!

  12. 4 Solution 1: locked room • Locked room protocol: 1. Agents enter. 2. Doors close, agents swap. 3. Agents check and commit. b 4. Doors open, agents leave. Commit A • Ensure that no information a leaves the room! Commit B • Ensure that agents are destroyed if one does not commit!

  13. 4 Solution 1: locked room • Locked room protocol: 1. Agents enter. 2. Doors close, agents swap. 3. Agents check and commit. b 4. Doors open, agents leave. A a • Ensure that no information B leaves the room! • Ensure that agents are destroyed if one does not commit!

  14. 4 Solution 1: locked room • Locked room protocol: 1. Agents enter. 2. Doors close, agents swap. 3. Agents check and commit. 4. Doors open, agents leave. • Ensure that no information leaves the room! • Ensure that agents are destroyed if one does not commit!

  15. 5 Trusted Processing Environment (TPE) • Provides secure execution environment on tamper proof hardware device. -1 K TPE I/O A 1 A 2 A n Crypto library library VM Communication Infrastructure OS Hardware Agent Owner TPE Owner • Protect agents from host and agents from agents. • Must be fully certified.

  16. 6 Implementation of solution 1 • Protection guarantees formalized as policies associated with underlying hardware. • Implement new fair exchange policy based on the following operations: ⋆ BeginFairExchange(AgentId id) ⋆ CommitFairExchange() ⋆ AbortFairExchange() • TPE restricts communication during exchange and destroys both agents if one doesn’t commit.

  17. 7 Solutions 2 & 3: use fair exchange agent • Use an intermediate fair exchange agent (FEA) to validate and swap items. • FEA performs exchange only if items are as expected. a b A B

  18. 7 Solutions 2 & 3: use fair exchange agent • Use an intermediate fair exchange agent (FEA) to validate and swap items. • FEA performs exchange only if items are as expected. a b A B FEA

  19. 7 Solutions 2 & 3: use fair exchange agent • Use an intermediate fair exchange agent (FEA) to validate and swap items. • FEA performs exchange only if items are as expected. a b A B FEA

  20. 7 Solutions 2 & 3: use fair exchange agent • Use an intermediate fair exchange agent (FEA) to validate and swap items. • FEA performs exchange only if items are as expected. a b check(b) check(a) A B FEA

  21. 7 Solutions 2 & 3: use fair exchange agent • Use an intermediate fair exchange agent (FEA) to validate and swap items. • FEA performs exchange only if items are as expected. b a A B FEA

  22. 7 Solutions 2 & 3: use fair exchange agent • Use an intermediate fair exchange agent (FEA) to validate and swap items. • FEA performs exchange only if items are as expected. b a A B FEA

  23. 8 The check routine problem • Validation must be done inside FEA. • Agents devise specific check method. • Must ensure that no information leaks out of check method = check routine problem. • Possible solutions: ⋆ Parametrized check routines. ⋆ Sandboxing. ⋆ . . .

  24. 9 Solution 2 • Let agents check the check routines and agree on a mutually checked FEA. • Agents trust FEA because executed code is ensured to be authentic. • Only generic TPE-policy of authentic code required (no change of TPE necessary).

  25. 9 Solution 2 • Let agents check the check routines and agree on a mutually checked FEA. • Agents trust FEA because executed code is ensured to be authentic. • Only generic TPE-policy of authentic code required (no change of TPE necessary).

  26. 9 Solution 2 • Let agents check the check routines and agree on a mutually checked FEA. • Agents trust FEA because executed code is ensured to be authentic. • Only generic TPE-policy of authentic code required (no change of TPE necessary).

  27. 10 Solution 3 • Use a trusted “free-lance” FEA to perform swap. • FEA must be certified. • Only basic TPE functionality required.

  28. 10 Solution 3 • Use a trusted “free-lance” FEA to perform swap. • FEA must be certified. • Only basic TPE functionality required.

  29. 10 Solution 3 • Use a trusted “free-lance” FEA to perform swap. • FEA must be certified. • Only basic TPE functionality required.

  30. 11 Solution summary and overview Solution Fairness Requirements on TPE ensured by 1. Locked TPE Specific fair exchange room operations 2. Authentic FEA code generic authentic code checking code 3. Free-lance FEA provider basic protection FEA Complexity of TPE

  31. 11 Solution summary and overview Solution Fairness Requirements on TPE ensured by 1. Locked TPE Specific fair exchange room operations 2. Authentic FEA code generic authentic code checking code 3. Free-lance FEA provider basic protection FEA Complexity of TPE

  32. 11 Solution summary and overview Solution Fairness Requirements on TPE ensured by 1. Locked TPE Specific fair exchange room operations 2. Authentic FEA code generic authentic code checking code 3. Free-lance FEA provider basic protection FEA Complexity of TPE

  33. 11 Solution summary and overview Solution Fairness Requirements on TPE ensured by 1. Locked TPE Specific fair exchange room operations 2. Authentic FEA code generic authentic code checking code 3. Free-lance FEA provider basic protection FEA Complexity of TPE

  34. 12 Advanced questions and future work • TPE ist still rather “fictional”: IBM 4758 PCI useable? • Adaption of protocols using other means to ensure security possible, e.g. Smartcards (prior talk by G¨ unter Karjoth)? • In Solutions 2 & 3 the FEA plays the role of a “trusted third party” (TTP). What constitutes a TTP and where is the TTP in solution 1?

  35. 13 Acknowledgements • Slides produced using “cutting edge” L A T EX slide processor PPower4 by Klaus Guntermann.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend