Sciweavers

140 search results - page 25 / 28
» Doing More with Fewer Bits
Sort
View
CRYPTO
2003
Springer
132views Cryptology» more  CRYPTO 2003»
14 years 21 days ago
On Cryptographic Assumptions and Challenges
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
Moni Naor
MJ
2007
119views more  MJ 2007»
13 years 7 months ago
Automated energy calculation and estimation for delay-insensitive digital circuits
With increasingly smaller feature sizes and higher on-chip densities, the power dissipation of VLSI systems has become a primary concern for designers. This paper first describes...
Venkat Satagopan, Bonita Bhaskaran, Anshul Singh, ...
IACR
2011
127views more  IACR 2011»
12 years 7 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
ICASSP
2008
IEEE
14 years 1 months ago
Secure wireless communications: Secret keys through multipath
Secure wireless communications is a challenging problem due to the shared nature of the wireless medium. Most existing security protocols apply cryptographic techniques for bit sc...
Akbar M. Sayeed, Adrian Perrig
ASIACRYPT
2005
Springer
14 years 1 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern