نتایج جستجو برای: applied pi calculus

تعداد نتایج: 666487  

Journal: :BRICS Report Series 1997

2010
Bo MENG

The practical Internet voting protocols should have: privacy, completeness, soundness, unreusability, fairness, eligibility, and invariableness, universal verifiability, receipt-freeness, and coercion-resistance. Privacy describes the fact that a particular vote in a particular way is not revealed to anyone. Receipt-freeness means that the voter can not produce a receipt to prove that he votes ...

2007
Francis Klay Liana Bozga Yassine Lakhnech Laurent Mazaré Stéphanie Delaune Steve Kremer

Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. The applied pi calculus is a formalism for modelling such protocols, and allows us to verify properties by using ...

2009
Rohit Chadha Stéphanie Delaune Steve Kremer

We propose an epistemic logic for the applied pi calculus, which is a variant of the pi calculus with extensions for modeling cryptographic protocols. In such a calculus, the security guarantees are usually stated as observational equivalence. While process calculi provide a natural means to describe the protocols themselves, epistemic logics are often better suited for expressing certain secur...

2005
Steve Kremer Mark Ryan

Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. The applied pi calculus is a formalism for modelling such protocols, and allows us to verify properties by using ...

Journal: :IACR Cryptology ePrint Archive 2017
Alessandro Cilardo Andrea Primativo

Trusted computing technologies may play a key role for cloud security as they enable users to relax the trustworthiness assumptions about the provider that operates the physical cloud infrastructure. This work focuses on the possibility of embodying Field-Programmable Gate Array (FPGA) devices in cloud-based infrastructures, where they can bene t computeintensive workloads like data compression...

2015
Roly Perera James Cheney

We present a formalisation in Agda of the theory of concurrent transitions, residuation, and causal equivalence of traces for the π-calculus. Our formalisation employs de Bruijn indices and dependently-typed syntax, and aligns the “proved transitions” proposed by Boudol and Castellani in the context of CCS with the proof terms naturally present in Agda’s representation of the labelled transitio...

Journal: :Theoretical Computer Science 2008

2006
Avik Chaudhuri Martín Abadi

We model networked storage systems with distributed, cryptographically enforced file-access control in an applied pi calculus. The calculus contains cryptographic primitives and supports file-system constructs, including access revocation. We establish that the networked storage systems implement simpler, centralized storage specifications with local access-control checks. More specifically, we...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید