Sciweavers

370 search results - page 2 / 74
» Limits of Constructive Security Proofs
Sort
View
CSFW
2010
IEEE
13 years 10 months ago
Strong Invariants for the Efficient Construction of Machine-Checked Protocol Security Proofs
We embed an operational semantics for security protocols in the interactive theorem prover Isabelle/HOL and derive two strong protocol-independent invariants. These invariants allo...
Simon Meier, Cas J. F. Cremers, David A. Basin
EUROCRYPT
2008
Springer
13 years 8 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
ICALP
2005
Springer
14 years 18 days ago
Single-Key AIL-MACs from Any FIL-MAC
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
Ueli M. Maurer, Johan Sjödin
CCS
2007
ACM
14 years 1 months ago
Attribute-based encryption with non-monotonic access structures
We construct an Attribute-Based Encryption (ABE) scheme that allows a user’s private key to be expressed in terms of any access formula over attributes. Previous ABE schemes wer...
Rafail Ostrovsky, Amit Sahai, Brent Waters
ASIACRYPT
1991
Springer
13 years 10 months ago
Limitations of the Even-Mansour Construction
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
Joan Daemen