Sciweavers

3420 search results - page 458 / 684
» A Language-Based Approach to Security
Sort
View
JMLR
2006
113views more  JMLR 2006»
15 years 6 months ago
On Inferring Application Protocol Behaviors in Encrypted Network Traffic
Several fundamental security mechanisms for restricting access to network resources rely on the ability of a reference monitor to inspect the contents of traffic as it traverses t...
Charles V. Wright, Fabian Monrose, Gerald M. Masso...
ENTCS
2007
168views more  ENTCS 2007»
15 years 6 months ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
ICISC
2009
169views Cryptology» more  ICISC 2009»
15 years 4 months ago
Generic One Round Group Key Exchange in the Standard Model
Minimizing complexity of group key exchange (GKE) protocols is an important milestone towards their practical deployment. An interesting approach to achieve this goal is to simplif...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...
TIT
2010
130views Education» more  TIT 2010»
15 years 1 months ago
Pseudo-random functions and parallelizable modes of operations of a block cipher
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
Palash Sarkar
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 10 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...