Sciweavers

49 search results - page 8 / 10
» Efficient Public Key Generation for HFE and Variations
Sort
View
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
14 years 7 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...
TVCG
2010
151views more  TVCG 2010»
13 years 2 months ago
Interactive Visual Analysis of Multiple Simulation Runs Using the Simulation Model View: Understanding and Tuning of an Electron
Multiple simulation runs using the same simulation model with different values of control parameters usually generate large data sets that capture the variational aspects of the be...
Kresimir Matkovic, Denis Gracanin, Mario Jelovic, ...
CRYPTO
2010
Springer
208views Cryptology» more  CRYPTO 2010»
13 years 8 months ago
Improved Delegation of Computation Using Fully Homomorphic Encryption
Following Gennaro, Gentry, and Parno (Cryptology ePrint Archive 2009/547), we use fully homomorphic encryption to design improved schemes for delegating computation. In such schem...
Kai-Min Chung, Yael Kalai, Salil P. Vadhan
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
13 years 11 months ago
Limited Verifier Signature from Bilinear Pairings
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
GLVLSI
2009
IEEE
142views VLSI» more  GLVLSI 2009»
13 years 11 months ago
Design tools for emerging technologies
The rapidly expanding diversity of technology available at the nanoscale is disrupting the existing transistorcentric microelectronics design paradigm, resulting in nearly decade-l...
Jacob White