ACM Home Page
Please provide us with feedback. Feedback
Trust management for secure information flows
Full text PdfPdf (1.03 MB)
Source
Conference on Computer and Communications Security archive
Proceedings of the 15th ACM conference on Computer and communications security table of contents
Alexandria, Virginia, USA
SESSION: Software security 2 table of contents
Pages 175-188  
Year of Publication: 2008
ISBN:978-1-59593-810-7
Authors
Mudhakar Srivatsa  IBM T.J. Watson Research Center, New York, NY, USA
Shane Balfe  Royal Holloway, University of London, Egham, United Kingdom
Kenneth G. Paterson  Royal Holloway, University of London, Egham, United Kingdom
Pankaj Rohatgi  IBM T.J. Watson Research Center, New York, NY, USA
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 45,   Downloads (12 Months): 605,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1455770.1455794
What is a DOI?

ABSTRACT

In both the commercial and defence sectors a compelling need is emerging for the rapid, yet secure, dissemination of information across traditional organisational boundaries. In this paper we present a novel trust management paradigm for securing pan-organisational information flows that aims to address the threat of information leakage. Our trust management system is built around an economic model and a trust-based encryption primitive wherein: (i) entities purchase a key from a Trust Authority (TA) which is bound to a voluntarily reported trust score r, (ii) information flows are encrypted such that a flow tagged with a recipient trust score R can be decrypted by the recipient only if it possesses the key corresponding to a voluntarily reported score r < = R, (iii) the economic model (the price of keys) is set such that a dishonest entity wishing to maximise information leakage is incentivised to report an honest trust score r to the TA. This paper makes two important contributions. First, we quantify fundamental tradeoffs on information flow rate, information leakage rate and error in estimating recipient trust score R. Second, we present a suite of encryption schemes that realise our trust-based encryption primitive and identify computation and communication tradeoffs between them.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
G. Athanasiou, L. Tassiulas, and G. S. Yovanof. Overcoming Misbehaviour in Mobile Ad Hoc Networks: An Overview. Crossroads The ACM Student Magazine, (114):23--30, 2005.
 
3
D. Balfanz, D.K. Smetters, P. Stewart, and H.C. Wong. Talking To Strangers: Authentication in Ad-Hoc Wireless Networks. In Proceedings of the Network and Distributed System Security Symposium (NDSS 2002). The Internet Society, 2002.
 
4
S. Balfe, K. Boklan, Z. Klagsburn, and K.G. Paterson. Key Refreshing in Identity-based Cryptography and its Applications in MANETs. In Proceedings of the 2007 IEEE Military Communications Conference (Milcom 2007), 2007.
 
5
M. Barbosa and P. Farshim. Efficient Identity-Based Key Encapsulation to Multiple Parties. In Cryptography and Coding, volume 3796 of Lecture Notes in Computer Science, 2005.
 
6
 
7
D. Boneh, X. Boyen, and E.-J. Goh. Hierarchical Identity-Based Encryption with Constant Size Ciphertext. In EUROCRYPT, volume 3494 of Lecture Notes in Computer Science, pages 440--456. Springer, 2005.
 
8
 
9
D. Boneh and B. Waters. Conjunctive, Subset, and Range Queries on Encrypted Data. In Proceedings of the 4th Theory of Cryptography Conference (TCC 2007), volume 4392 of LNCS, pages 535--554. Springer, 2007.
 
10
S. Buchegger and J.-Y. Le Boudec. Self-Policing Mobile Ad Hoc Networks by Reputation Systems. Communications Magazine, IEEE, 43(7):101--107, 2005.
 
11
 
12
 
13
 
14
 
15
 
16
 
17
 
18
 
19
20
 
21
P. Farshim. Extensions of Public-Key, Identity-Based and Certificateless Encryption Schemes. PhD thesis, University of Bristol, 2008.
 
22
 
23
 
24
Q. He, D. Wu, and P. Khosla. SORI: A Secure and Objective Reputation-Based Incentive Scheme for Ad--Hoc Networks. In Proceedings of the 3rd IEEE Wireless Communications and Networking Conference, (WCNC 2004), pages 825--830. IEEE Press, 2004.
 
25
K. Hoeper and G. Gong. Bootstrapping Security in Mobile Ad Hoc Networks Using Identity-Based Schemes with Key Revocation. Technical Report CACR 2006-04, Centre for Applied Cryptographic Research (CACR) at the University of Waterloo, Canada, 2006.
 
26
D. Hwang, B.-C. C. Lai, and I. Verbauwhede. Energy-Memory-Security Tradeoffs in Distributed Sensor Networks. In Ad-Hoc, Mobile, and Wireless Networks: 3rd International Conference, ADHOC--NOW, pages 70--81. Springer-Verlag, 2004.
27
 
28
 
29
K. Lai, M. Feldman, I. Stoica, and J. Chuang. Incentives for Cooperation in Peer-to-Peer Networks. In Proceedings of the 1st Workshop on Economics of Peer-to-Peer Systems, 2003.
30
 
31
 
32
C.D. McCollum and J.R. Messing L. Notargiacomo. Beyond the Pale of MAC and DAC-Defining New Forms of Access Control. In Proceedings of the 1990 IEEE Symposium on Security and Privacy (S&P 1990), pages 190--200. IEEE Computer Society, 1990.
 
33
34
 
35
A.C. Myers and B. Liskov. Complete Safe Information Flow with Decentralized Labels. In Proceedings of the 1998 IEEE Symposium on Security and Privacy (S&P 1998), pages 186--197. IEEE Computer Society, 2001.
 
36
Jason Program Office. HORIZONTAL INTEGRATION: Broader Access Models for Realizing Information Dominance. Special Report JSR-04-13, MITRE Corporation, 2004.
 
37
 
38
 
39
D. Roberts, G. Lock, and D.C. Verma. Holistan: A Futuristic Scenario for International Coalition Operations. In In Proceedings of 4th International Conference on Knowledge Systems for Coalition Operations (KSCO 2007), 2007.
 
40
 
41
M. Srivatsa, D. Agrawal, and S. Balfe. A Metadata Calculus for Securing Information Flows. In Proceedings of 26th Army Science Conference (ASC 2008), 2008.
 
42
 
43
G. Stoneburner, A. Goguen, and A. Feringa. Risk Management Guide for Information Technology Systems. Special Report 800-300, NIST, 2002.
 
44
N. Swamy, M. Hicks, and S. Tsang. Verified Enforcement of Security Policies for Cross-Domain Information Flows. In Proceedings of the 2007 Military Communications Conference (MILCOM 2007), pages 192--206. IEEE Computer Society, 2007.
 
45
R. Anderson T. Moore, J. Clulow and S. Nagaraja. New Strategies for Revocation in Ad-Hoc Networks. In Proceedings of the 4th European Workshop on Security and Privacy in Ad Hoc and Sensor Networks (ESAS 2007), pages 232--246. Springer, 2007.
 
46
 
47
48
 
49
 
50
S. Zhong, J. Chen, and Y. R. Yang. Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003), pages 1987--1997. IEEE Press, 2003.
 
51

Collaborative Colleagues:
Mudhakar Srivatsa: colleagues
Shane Balfe: colleagues
Kenneth G. Paterson: colleagues
Pankaj Rohatgi: colleagues