Sciweavers

1696 search results - page 129 / 340
» Permuted function matching
Sort
View
98
Voted
FOCS
2003
IEEE
15 years 4 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
CTRSA
2003
Springer
96views Cryptology» more  CTRSA 2003»
15 years 4 months ago
Hardware Performance Characterization of Block Cipher Structures
In this paper, we present a general framework for evaluating the performance characteristics of block cipher structures composed of S-boxes and Maximum Distance Separable (MDS) ma...
Lu Xiao, Howard M. Heys
88
Voted
DAC
1999
ACM
15 years 3 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
111
Voted
ASIACRYPT
2007
Springer
15 years 2 months ago
On Efficient Message Authentication Via Block Cipher Design Techniques
In an effort to design a MAC scheme that is built using block cipher components and runs faster than the modes of operation for message authentication, Daemen and Rijmen have propo...
Goce Jakimoski, K. P. Subbalakshmi
ITP
2010
159views Mathematics» more  ITP 2010»
15 years 2 months ago
Programming Language Techniques for Cryptographic Proofs
CertiCrypt is a general framework to certify the security of cryptographic primitives in the Coq proof assistant. CertiCrypt adopts the code-based paradigm, in which the statement ...
Gilles Barthe, Benjamin Grégoire, Santiago ...