Sciweavers

252 search results - page 5 / 51
» How Secure is Deterministic Encryption
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
15 years 2 months ago
How to prevent type-flaw attacks on security protocols under algebraic properties
In this paper, we prove that type-tagging prevents type-flaw attacks on security protocols that use the Exclusive-OR operator as our main contribution. Our proof method is general ...
Sreekanth Malladi, Pascal Lafourcade
IJISEC
2006
108views more  IJISEC 2006»
15 years 2 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
TCC
2005
Springer
176views Cryptology» more  TCC 2005»
15 years 7 months ago
How to Securely Outsource Cryptographic Computations
We address the problem of using untrusted (potentially malicious) cryptographic helpers. We provide a formal security definition for securely outsourcing computations from a comp...
Susan Hohenberger, Anna Lysyanskaya
CTRSA
2006
Springer
157views Cryptology» more  CTRSA 2006»
15 years 6 months ago
How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...
Yitao Duan, John F. Canny
PAIRING
2010
Springer
149views Cryptology» more  PAIRING 2010»
15 years 5 days ago
Constructing Certificateless Encryption and ID-Based Encryption from ID-Based Key Agreement
Abstract. We discuss the relationship between ID-based key agreement protocols, certificateless encryption and ID-based key encapsulation mechanisms. In particular we show how in s...
Dario Fiore, Rosario Gennaro, Nigel P. Smart