Sciweavers

718 search results - page 121 / 144
» Security protocols, properties, and their monitoring
Sort
View
CCR
2007
135views more  CCR 2007»
15 years 1 months ago
Future internet: fundamentals and measurement
While the Internet is hardly “broken”, it has proved unable to integrate new ideas, new architectures, and provide paths for future integration of data, voice, rich media and ...
Thrasyvoulos Spyropoulos, Serge Fdida, Scott Kirkp...
CCS
2006
ACM
15 years 5 months ago
An effective defense against email spam laundering
Laundering email spam through open-proxies or compromised PCs is a widely-used trick to conceal real spam sources and reduce spamming cost in underground email spam industry. Spam...
Mengjun Xie, Heng Yin, Haining Wang
TIT
2008
164views more  TIT 2008»
15 years 1 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
145
Voted
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
15 years 8 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
IACR
2011
196views more  IACR 2011»
14 years 1 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs