Sciweavers

94 search results - page 9 / 19
» On the complexity of verifiable secret sharing and multipart...
Sort
View
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 8 months ago
Eliminating Quadratic Slowdown in Two-Prime RSA Function Sharing
The nature of the RSA public modulus N as a composite of at least two secret large primes was always considered as a major obstacle facing the RSA function sharing without the hel...
Maged Hamada Ibrahim
JCP
2006
135views more  JCP 2006»
13 years 8 months ago
Improved Double Auction Protocol based on a Hybrid Trust Model
Recently, Wang et al. proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive ...
JungHoon Ha, Jianying Zhou, Sang-Jae Moon
WPES
2005
ACM
14 years 2 months ago
Privacy for RFID through trusted computing
Radio Frequency Identification (RFID) technology raises significant privacy issues because it enables tracking of items and people possibly without their knowledge or consent. O...
David Molnar, Andrea Soppera, David Wagner
FC
2010
Springer
196views Cryptology» more  FC 2010»
14 years 14 days ago
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers
ENTCS
2006
176views more  ENTCS 2006»
13 years 8 months ago
Gauss: A Framework for Verifying Scientific Computing Software
High performance scientific computing software is of critical international importance as it supports scientific explorations and engineering. Software development in this area is...
Robert Palmer, Steve Barrus, Yu Yang, Ganesh Gopal...