Sciweavers

5475 search results - page 899 / 1095
» Model Driven Security
Sort
View
ASIACRYPT
2010
Springer
15 years 4 months ago
Lattice-Based Blind Signatures
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
Markus Rückert
CSFW
2011
IEEE
14 years 6 months ago
Local Memory via Layout Randomization
—Randomization is used in computer security as a tool to introduce unpredictability into the software infrastructure. In this paper, we study the use of randomization to achieve ...
Radha Jagadeesan, Corin Pitcher, Julian Rathke, Ja...
IACR
2011
196views more  IACR 2011»
14 years 6 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
PKC
2009
Springer
121views Cryptology» more  PKC 2009»
16 years 7 months ago
On the Theory and Practice of Personal Digital Signatures
We take a step towards a more realistic modeling of personal digital signatures, where a human user, his mobile equipment, his PC and a server are all considered as independent pla...
Gert Læssøe Mikkelsen, Ivan Damg&arin...
KDD
2006
ACM
128views Data Mining» more  KDD 2006»
16 years 6 months ago
Workload-aware anonymization
Protecting data privacy is an important problem in microdata distribution. Anonymization algorithms typically aim to protect individual privacy, with minimal impact on the quality...
Kristen LeFevre, David J. DeWitt, Raghu Ramakrishn...