Sciweavers

17 search results - page 3 / 4
» Security of Random Feistel Schemes with 5 or More Rounds
Sort
View
IJNSEC
2010
128views more  IJNSEC 2010»
13 years 3 months ago
New Efficient Searchable Encryption Schemes from Bilinear Pairings
Public key encryption with keyword search (PEKS) enables user Alice to send a secret key TW to a server that will enable the server to locate all encrypted messages containing the...
Chunxiang Gu, Yuefei Zhu
ACNS
2006
Springer
117views Cryptology» more  ACNS 2006»
14 years 3 months ago
Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...
Ahto Buldas, Sven Laur
LATINCRYPT
2010
13 years 7 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
TCC
2007
Springer
145views Cryptology» more  TCC 2007»
14 years 3 months ago
(Password) Authenticated Key Establishment: From 2-Party to Group
Abstract. A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment...
Michel Abdalla, Jens-Matthias Bohli, Maria Isabel ...
TRUST
2010
Springer
14 years 2 months ago
A Pairing-Based DAA Scheme Further Reducing TPM Resources
Direct Anonymous Attestation (DAA) is an anonymous signature scheme designed for anonymous attestation of a Trusted Platform Module (TPM) while preserving the privacy of the devic...
Ernie Brickell, Jiangtao Li