Sciweavers

258 search results - page 11 / 52
» Securing Provenance
Sort
View
CCS
1999
ACM
14 years 2 months ago
Signature Schemes Based on the Strong RSA Assumption
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
Ronald Cramer, Victor Shoup
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
14 years 2 months ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
EUROCRYPT
2010
Springer
14 years 2 months ago
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...
Allison B. Lewko, Tatsuaki Okamoto, Amit Sahai, Ka...
IEEEARES
2010
IEEE
14 years 4 months ago
Pitfalls in Formal Reasoning about Security Protocols
Formal verification can give more confidence in the security of cryptographic protocols. Application specific security properties like “The service provider does not loose mo...
Nina Moebius, Kurt Stenzel, Wolfgang Reif
PROVSEC
2007
Springer
14 years 4 months ago
On the Notions of PRP - RKA , KR and KR - RKA for Block Ciphers
Security of a modern block cipher is commonly measured in terms of its resistance to known attacks. While the provable security approach to block ciphers dates back to the first C...
Ermaliza Razali, Raphael C.-W. Phan, Marc Joye