Sciweavers

300 search results - page 28 / 60
» Formal Methods for Smartcard Security
Sort
View
CCS
2000
ACM
13 years 12 months ago
Composition and integrity preservation of secure reactive systems
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
Birgit Pfitzmann, Michael Waidner
ASIAN
2007
Springer
126views Algorithms» more  ASIAN 2007»
14 years 1 months ago
Computational Semantics for Basic Protocol Logic - A Stochastic Approach
Abstract. This paper is concerned about relating formal and computational models of cryptography in case of active adversaries when formal security analysis is done with first ord...
Gergei Bana, Koji Hasebe, Mitsuhiro Okada
WISA
2009
Springer
14 years 2 months ago
You Cannot Hide behind the Mask: Power Analysis on a Provably Secure S-Box Implementation
Power analysis has shown to be successful in breaking symmetric cryptographic algorithms implemented on low resource devices. Prompted by the breaking of many protected implementat...
J. Pan, J. I. den Hartog, Jiqiang Lu
CISC
2007
Springer
133views Cryptology» more  CISC 2007»
14 years 1 months ago
Unlinkable Randomizable Signature and Its Application in Group Signature
We formalize a generic method of constructing efficient group signatures, specifically, we define new notions of unlinkable randomizable signature, indirectly signable signature ...
Sujing Zhou, Dongdai Lin
ESMART
2001
Springer
14 years 3 days ago
An Operational Semantics of the Java Card Firewall
This paper presents an operational semantics for a subset of Java Card bytecode, focussing on aspects of the Java Card firewall, method invocation, field access, variable access,...
Marc Éluard, Thomas P. Jensen, Ewen Denney