Sciweavers

111 search results - page 11 / 23
» Security under key-dependent inputs
Sort
View
SP
2010
IEEE
217views Security Privacy» more  SP 2010»
13 years 11 months ago
Experimental Security Analysis of a Modern Automobile
Abstract—Modern automobiles are no longer mere mechanical devices; they are pervasively monitored and controlled by dozens of digital computers coordinated via internal vehicular...
Karl Koscher, Alexei Czeskis, Franziska Roesner, S...
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 7 months ago
(Unconditional) Secure Multiparty Computation with Man-in-the-middle Attacks
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
Shailesh Vaya
TIT
2008
164views more  TIT 2008»
13 years 7 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
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 7 months ago
Experimenting with Innate Immunity
libtissue is a software system for implementing and testing AIS algorithms on real-world computer security problems. AIS algorithms are implemented as a collection of cells, antig...
Jamie Twycross, Uwe Aickelin
TCC
2007
Springer
110views Cryptology» more  TCC 2007»
14 years 1 months ago
Robuster Combiners for Oblivious Transfer
Abstract. A (k; n)-robust combiner for a primitive F takes as input n candidate implementations of F and constructs an implementation of F, which is secure assuming that at least k...
Remo Meier, Bartosz Przydatek, Jürg Wullschle...