Sciweavers

977 search results - page 9 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
CRYPTO
2006
Springer
99views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Scalable Secure Multiparty Computation
We present the first general protocol for secure multiparty computation which is scalable, in the sense that the amortized work per player does not grow, and in some natural settin...
Ivan Damgård, Yuval Ishai
FOCS
2006
IEEE
14 years 1 months ago
Input-Indistinguishable Computation
We put forward a first definition of general secure computation that, without any trusted set-up, • handles an arbitrary number of concurrent executions; and • is implementa...
Silvio Micali, Rafael Pass, Alon Rosen
CRYPTO
2012
Springer
277views Cryptology» more  CRYPTO 2012»
11 years 10 months ago
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithm...
Ivan Damgård, Valerio Pastro, Nigel P. Smart...
NORDSEC
2009
Springer
14 years 2 months ago
Towards True Random Number Generation in Mobile Environments
In our paper, we analyze possibilities to generate true random data in mobile devices such as mobile phones or pocket computers. We show how to extract arguably true random data w...
Jan Bouda, Jan Krhovjak, Vashek Matyas, Petr Svend...
EUC
2005
Springer
14 years 1 months ago
Program Obfuscation Scheme Using Random Numbers to Complicate Control Flow
Abstract. For the security technology that has been achieved with software in the computer system and the protection of the intellectual property right of software, software protec...
Tatsuya Toyofuku, Toshihiro Tabata, Kouichi Sakura...