Sciweavers

258 search results - page 12 / 52
» Securing Provenance
Sort
View
CRYPTO
2010
Springer
195views Cryptology» more  CRYPTO 2010»
13 years 11 months ago
Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption
This paper presents a fully secure functional encryption scheme for a wide class of relations, that are specified by non-monotone access structures combined with inner-product rel...
Tatsuaki Okamoto, Katsuyuki Takashima
ACNS
2005
Springer
111views Cryptology» more  ACNS 2005»
14 years 3 months ago
Badger - A Fast and Provably Secure MAC
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is us...
Martin Boesgaard, Thomas Christensen, Erik Zenner
JCS
2002
118views more  JCS 2002»
13 years 9 months ago
Verified Formal Security Models for Multiapplicative Smart Cards
We present two generic formal security models for operating systems of multiapplicative smart cards. The models formalize the main security aspects of secrecy, integrity, secure co...
Gerhard Schellhorn, Wolfgang Reif, Axel Schairer, ...
TCC
2007
Springer
125views Cryptology» more  TCC 2007»
14 years 4 months ago
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard crypto...
Carmit Hazay, Jonathan Katz, Chiu-Yuen Koo, Yehuda...
WETICE
2005
IEEE
14 years 3 months ago
Application of Lightweight Formal Methods to Software Security
Formal specification and verification of security has proven a challenging task. There is no single method that has proven feasible. Instead, an integrated approach which combines...
David P. Gilliam, John D. Powell, Matt Bishop