Sciweavers

107 search results - page 16 / 22
» A secure compiler for session abstractions
Sort
View
TPHOL
2008
IEEE
15 years 6 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
IACR
2011
132views more  IACR 2011»
13 years 11 months ago
Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
Abstract. Tampering attacks are cryptanalytic attacks on the implementation of cryptographic algorithms (e.g., smart cards), where an adversary introduces faults with the hope that...
Sebastian Faust, Krzysztof Pietrzak, Daniele Ventu...
89
Voted
ICLP
2003
Springer
15 years 4 months ago
Flow Java: Declarative Concurrency for Java
Abstract. Logic variables pioneered by (concurrent) logic and concurrent constraint programming are powerful mechanisms for automatically synchronizing concurrent computations. The...
Frej Drejhammar, Christian Schulte, Per Brand, Sei...
99
Voted
PPDP
2005
Springer
15 years 5 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
105
Voted
ASIACRYPT
2004
Springer
15 years 5 months ago
Constant-Round Authenticated Group Key Exchange for Dynamic Groups
Abstract. An authenticated group key exchange (AGKE) scheme allows a group of users in a public network to share a session key which may later be used to achieve desirable cryptogr...
Hyun-Jeong Kim, Su-Mi Lee, Dong Hoon Lee