Sciweavers

126
Voted
CTRSA
2007
Springer
102views Cryptology» more  CTRSA 2007»
15 years 9 months ago
Improved Efficiency for Private Stable Matching
At Financial Crypto 2006, Golle presented a novel framework for the privacy preserving computation of a stable matching (stable marriage). We show that the communication complexity...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
132
Voted
CTRSA
2007
Springer
153views Cryptology» more  CTRSA 2007»
15 years 9 months ago
Differential Power Analysis of Stream Ciphers
Side-channel attacks on block ciphers and public key algorithms have been discussed extensively. However, there is only sparse literature about side-cannel attacks on stream cipher...
Wieland Fischer, Berndt M. Gammel, O. Kniffler, J....
CSR
2007
Springer
15 years 9 months ago
On Empirical Meaning of Randomness with Respect to a Real Parameter
We study the empirical meaning of randomness with respect to a family of probability distributions P, where is a real parameter, using algorithmic randomness theory. In the case w...
Vladimir V. V'yugin
132
Voted
CSR
2007
Springer
15 years 9 months ago
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
Victor Poupet
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
15 years 9 months ago
On Related-Secret Pseudorandomness
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among ke...
David Goldenberg, Moses Liskov