Sciweavers

87 search results - page 16 / 18
» A Verifiable Random Function with Short Proofs and Keys
Sort
View
CRYPTO
2008
Springer
98views Cryptology» more  CRYPTO 2008»
14 years 11 months ago
One-Time Programs
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothbl...
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
15 years 10 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan
EUROCRYPT
2009
Springer
15 years 10 months ago
Smashing SQUASH-0
At the RFID Security Workshop 2007, Adi Shamir presented a new challenge-response protocol well suited for RFIDs, although based on the Rabin public-key cryptosystem. This protocol...
Khaled Ouafi, Serge Vaudenay
CORR
2011
Springer
177views Education» more  CORR 2011»
14 years 1 months ago
Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks
The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast chann...
Marios Kountouris, Jeffrey G. Andrews
86
Voted
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 1 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner