Sabrina De Capitani di Vimercati
Sabrina De Capitani di Vimercati
Computer Science Department, Universita' degli Studi di Milano, Italy
Dirección de correo verificada de unimi.it - Página principal
Título
Citado por
Citado por
Año
Access control: Policies, models, and mechanisms
P Samarati, S De Capitani di Vimercati
Foundations of Security Analysis and Design, 137-196, 2001
9522001
A reputation-based approach for choosing reliable resources in peer-to-peer networks
E Damiani, S De Capitani di Vimercati, S Paraboschi, P Samarati, ...
Proceedings of the 9th ACM conference on Computer and communications …, 2002
9492002
de Capitani di Vimercati, S.(2001). Access control: Policies, models, and mechanisms
P Samarati
FOSAD 2000, 134-196, 0
948*
A Fine-Grained Access Control System for XML Documents
E Damiani, S De Capitani di Vimercati, S Paraboschi, P Samarati
ACM Transactions on Information and System Security 5, 2002
7312002
Choosing Reputable Servents in a P2P Network
F Cornelli, E Damiani, S De Capitani di Vimercati, S Paraboschi, ...
6582002
Choosing reputable servents in a P2P network
F Cornelli, E Damiani, SDC Di Vimercati, S Paraboschi, P Samarati
Proceedings of the 11th international conference on World Wide Web, 376-386, 2002
6482002
Over-encryption: management of access control evolution on outsourced data
S De Capitani di Vimercati, S Foresti, S Jajodia, S Paraboschi, P Samarati
Proceedings of the 33rd international conference on Very large data bases …, 2007
5372007
Balancing confidentiality and efficiency in untrusted relational DBMSs
E Damiani, S De Capitani di Vimercati, S Jajodia, S Paraboschi, ...
Proceedings of the 10th ACM conference on Computer and communications …, 2003
4692003
Global viewing of heterogeneous data sources
S Castano, V De Antonellis, S De Capitani di Vimercati
Knowledge and Data Engineering, IEEE Transactions on 13 (2), 277-297, 2001
4302001
An algebra for composing access control policies
P Bonatti, S De Capitani di Vimercati, P Samarati
ACM Transactions on Information and System Security (TISSEC) 5 (1), 1-35, 2002
4152002
Location-privacy protection through obfuscation-based techniques
C Ardagna, M Cremonini, E Damiani, S De Capitani di Vimercati, ...
Proceedings of the 21st Annual IFIP WG 11, 2007
3652007
Securing XML documents
E Damiani, S De Capitani di Vimercati, S Paraboschi, P Samarati
Advances in Database Technology—EDBT 2000, 121-135, 2000
3482000
Managing and sharing servants' reputations in P2P systems
E Damiani, SDC Di Vimercati, S Paraboschi, P Samarati
IEEE Transactions on Knowledge and Data Engineering 15 (4), 840-854, 2003
2732003
Design and implementation of an access control processor for XML documents
E Damiani, SC di Vimercati, S Paraboschi, P Samarati
Computer Networks 33 (1-6), 59-75, 2000
2602000
An obfuscation-based approach for protecting location privacy
CA Ardagna, M Cremonini, SDC di Vimercati, P Samarati
IEEE Transactions on Dependable and Secure Computing 8 (1), 13-27, 2009
2442009
k-Anonymity
V Ciriani, S De Capitani di Vimercati, S Foresti, P Samarati
Secure Data Management in Decentralized Systems, 323-353, 2007
242*2007
Combining fragmentation and encryption to protect privacy in data storage
V Ciriani, S De Capitani di Vimercati, S Foresti, S Jajodia, S Paraboschi, ...
ACM Transactions on Information and System Security (TISSEC) 13 (3), 22, 2010
2232010
Supporting location-based conditions in access control policies
CA Ardagna, M Cremonini, E Damiani, S De Capitani di Vimercati, ...
Proceedings of the 2006 ACM Symposium on Information, computer and …, 2006
1952006
Data protection in outsourcing scenarios: issues and directions
P Samarati, S De Capitani di Vimercati
Proceedings of the 5th ACM Symposium on Information, Computer and …, 2010
1822010
Fuzzy techniques for trust and reputation management in anonymous peer‐to‐peer systems
R Aringhieri, E Damiani, S De Capitani di Vimercati, S Paraboschi, ...
Journal of the American Society for Information Science and Technology 57 (4 …, 2006
1752006
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20