Sciweavers

1769 search results - page 128 / 354
» Cryptography
Sort
View
149
Voted
CSFW
2012
IEEE
13 years 5 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
WWW
2001
ACM
16 years 4 months ago
XML Key Management Specification (XKMS)
The XML Key Management Specification (XKMS) is described. XKMS is a Web Service that provides an interface between an XML application and a Public Key Infrastructure (PKI). XKMS g...
Phillip M. Hallam-Baker, Warwick Ford
FSE
2009
Springer
472views Cryptology» more  FSE 2009»
16 years 3 months ago
Algebraic Techniques in Differential Cryptanalysis
In this paper we propose a new cryptanalytic method against block ciphers, which combines both algebraic and statistical techniques. More specifically, we show how to use algebraic...
Martin Albrecht, Carlos Cid
110
Voted
TCC
2009
Springer
114views Cryptology» more  TCC 2009»
16 years 3 months ago
Predicate Privacy in Encryption Systems
Predicate encryption is a new encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data. The master secret key owner can generat...
Emily Shen, Elaine Shi, Brent Waters
TCC
2009
Springer
131views Cryptology» more  TCC 2009»
16 years 3 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study...
S. Dov Gordon, Jonathan Katz