Executable choreography: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
m Alter: volume. Add: arxiv, hdl, chapter-url, citeseerx, issue. Removed or converted URL. Removed accessdate with no specified URL. Removed parameters. | You can use this bot yourself. Report bugs here. | User-activated.
Citation bot (talk | contribs)
m Removed URL that duplicated unique identifier. Removed parameters. | You can use this bot yourself. Report bugs here.| Activated by User:Corvusphalanx
Line 15:
 
=== Verifiable choreographies ===
Executable choreographies are a more general concept and are not necessarily verifiable choreographies if they do not use the idea of a site regarded as a security context for code execution. As examples of approaches to programming using executable choreographies, we could list the European project CHOReOS<ref>{{Cite web|url=http://www.choreos.eu|title=ChoreOS|last=|first=|date=|website=|archive-url=|archive-date=|deadurl=|accessdate=}}</ref>, the Chor programming language <ref>{{Cite web|url=http://www.chor-lang.org/|title=Chor Programming Language|last=|first=|date=|website=|archive-url=|archive-date=|deadurl=|accessdate=}}</ref>, the web service modeling in the "Choreographing Web Services" <ref>{{Cite journal|last=Barker|first=Adam|last2=Walton|first2=Christopher D.|last3=Robertson|first3=David|date=2004|title=Choreographing Web Services|journal=IEEE Transactions on Services Computing|volume=2|issue=2|pages=152–166|doi=10.1109/tsc.2009.8|issn=1939-1374|via=}}</ref> of some aspects related to the composition of web services using pi-calculus <ref>{{Citation|last=Besana|first=Paolo|title=On the Move to Meaningful Internet Systems: OTM 2009|date=2009|volume=5870|pages=373–380|series=Lecture Notes in Computer Science|publisher=Springer Berlin Heidelberg|language=en|doi=10.1007/978-3-642-05148-7_26|isbn=9783642051470|last2=Barker|first2=Adam|url=http://www.adambarker.org/papers/coopis09.pdf|citeseerx=10.1.1.525.2508}}</ref>. The verifiable term was introduced to highlight the possibility of verifying [[swarm choreographies]]. The explicit presence of the execution ___location idea leads to the possibility of developing verification algorithms as can be seen in the article "Levels of privacy for e-Health systems in the cloud era". <ref>{{Cite journal|last=|first=|date=2015|title=Levels of Privacy for e-Health systems in the cloud era|url=https://aisel.aisnet.org/cgi/viewcontent.cgi?article=1089&context=isd2014|journal=24th International Conference on Information Systems Development|volume=|pages=1–10|via=}}</ref>
 
=== Encrypted choreographies ===
Encrypted cryptography supposes that, in addition to verification, they offer higher-level solutions for advanced cryptographic methods without the need for programmers to become cryptography specialists. Distributed applications could be built from subsystems that allow identification or verification of architectural points that expose secret data. For example, ideally, a programming system that uses encrypted choreographs guarantees, or at least helps, minimize situations where a person (legally licensed or hacker) holds both encrypted private data and encryption keys related to the same resources. In this way, the administrators or programmers of these subsystems have fewer possibilities to perform internal attacks on privacy (the level with frequent attacks). Even if some applications can not use this approach, encrypted choreographies can minimize the security risks caused by the people inside who administer or program these systems. Thus, the number of points with discreet access to data (ideally never) is formally ensured. This form of choreography is useful to allow companies to secure by code the application of the legislation or security rules assumed.
 
The implementation of encrypted choreographies implies, for example, the existence of storage systems using cryptographic techniques with practical implementation of homomorphic encryption, such as the CryptDB <ref>{{Cite book|last=Popa|first=Raluca Ada|last2=Redfield|first2=Catherine M. S.|last3=Zeldovich|first3=Nickolai|last4=Balakrishnan|first4=Hari|date=2011-10-23|title=CryptDB: protecting confidentiality with encrypted query processing|chapter-url=http://dl.acm.org/citation.cfm?id=2043556.2043566|journal=|volume=|pages=85–100|doi=10.1145/2043556.2043566|isbn=9781450309776|via=|chapter=CryptDB|hdl=1721.1/74107}}</ref><ref>{{Cite journal|last=Tu|first=Stephen|last2=Kaashoek|first2=M. Frans|last3=Madden|first3=Samuel|last4=Zeldovich|first4=Nickolai|last5=Tu|first5=Stephen|last6=Kaashoek|first6=M. Frans|last7=Madden|first7=Samuel|last8=Zeldovich|first8=Nickolai|date=2013-03-01|title=Processing analytical queries over encrypted data, Processing analytical queries over encrypted data|journal=Proceedings of the VLDB Endowment|volume=6|issue=5|pages=289, 289–300, 300|doi=10.14778/2535573.2488336|issn=2150-8097}}</ref> implementation from MIT. A method that can also be called a "storage, division and anonymization method" with the help of encrypted choreographies, can lead to the ideal of having total "sovereignty" (within the limits of the law) on private data was published in the article "Private Data System enabling self-sovereign storage managed by executable choregraphies" <ref>{{Citation|last=Alboaie|first=Sinică|title=Distributed Applications and Interoperable Systems|date=2017|volume=10320|pages=83–98|series=Lecture Notes in Computer Science|publisher=Springer International Publishing|language=en|doi=10.1007/978-3-319-59665-5_6|isbn=9783319596648|last2=Cosovan|first2=Doina|arxiv=1708.09332}}</ref>. This paper presents how choreographies anonymize and divide data in a way that ensures that data can not be copied by a single administrator or hacker that controls only one of the participating nodes. The implemented mechanisms can also include interfaces that are easy to use by programmers for advanced cryptographic methods.
 
=== Serverless choreographies ===