http://www.bibsonomy.org/burst/concept/tag/securityBibSonomy BuRST Feed for /concept/tag/security2008-07-21T00:25:54+02:00http://www.bibsonomy.org/bibtex/2f110364c8cf809cfc05f68ab1da16dca/dawincidawinci2008-07-17T17:58:14+02:00feedback feedback_scheme reputation e-commerce security rating reputation_systems <span style="color:#555555;">Roslan <a href="http://www.bibsonomy.org/author/Ismail">Ismail</a> </span><em>Queensland University of Technology, Information Security Research Centre, </em><em>November2004. </em>Thu Jul 17 17:58:14 CEST 2008NovemberSecurity of Reputation Systems2004feedback feedback_scheme reputation e-commerce security rating reputation_systems Reputation systems have the potential of improving the quality of on-line markets by identifying fraudulent users and subsequently dealing with these users can be prevented. The behaviour of participants involved in e-commerce can be recorded and then this information made available to potential transaction partners to make decisions to choose a suitable counterpart. Unfortunately current reputation systems suffer from various vulnerabilities. Solutions for many of these problems will be discussed. One of the major threats is that of unfair feedback. A large number of negative or positive feedbacks could be submitted to a particular user with the aim to either downgrade or upgrade the user’s reputation. As a result the produced reputation does not reflect the user’s true trustworthiness. To overcome this threat a variation of Bayesian Reputation system is proposed. The proposed scheme is based on the subjective logic framework proposed Josang et al. [65]. The impact of unfair feedback is countered through some systematic approaches proposed in the scheme. Lack of anonymity for participants leads to reluctance to provide negative feedback. A novel solution for anonymity of feedback providers is proposed to allow participants to provide negative feedback when appropriate without fear of retaliation. The solution is based on several primitive cryptographic mechanisms; e-cash, designated verifier proof and knowledge proof. In some settings it is desirable for the reputation owner to control the distribution of its own reputation and to disclose this at its discretion to the intended parties. To realize this, a solution based on a certificate mechanism is proposed. This solution allows the reputation owner to keep the certificate and to distribute its reputation while not being able to alter that information without detection. The proposed solutions cater for two modes of reputation systems: centralised and decentralised. The provision of an off-line reputation system is discussed by proposing a new solution using certificates. This is achieved through the delegation concept and a variant of digital signature schemes known as proxy signatures. The thesis presents a security architecture of reputation systems which consists of different elements to safeguard reputation systems from malicious activities. Elements incorporated into this architecture include privacy, verifiability and availability. The architecture also introduces Bayesian approach to counter security threat posed by reputation systems. This means the proposed security architecture in the thesis is a combination of two prominent approaches, namely, Bayesian and cryptographic, to provide security for reputation systems. The proposed security architecture can be used as a basic framework for further development in identifying and incorporating required elements so that a total security solution for reputation systems can be achieved.http://www.bibsonomy.org/bibtex/282f814872692ac6a5d78d0d801ec124a/dawincidawinci2008-07-17T17:43:00+02:00security trust_management trust reputation reputation_systems <span style="color:#555555;">Audun <a href="http://www.bibsonomy.org/author/Jøsang">J&#248;sang</a> and Claudia <a href="http://www.bibsonomy.org/author/Keser">Keser</a> and Theodosis <a href="http://www.bibsonomy.org/author/Dimitrakos">Dimitrakos</a> </span><em>Trust Management, </em><em>volume3477ofLecture Notes in Computer Science, </em><em>page93--107. </em><em>Springer, </em><em>May2005. </em>Thu Jul 17 17:43:00 CEST 2008Trust ManagementMay93--107Lecture Notes in Computer ScienceCan We Manage Trust?34772005security trust_management trust reputation reputation_systems The term trust management suggests that trust can be managed, for example by creating trust, by assessing trustworthiness, or by determining optimal decisions based on specific levels of trust. The problem to date is that trust management in online environments is a diverse and ill defined discipline. In fact, the term trust management is being used with very different meanings in different contexts. This paper examines various approaches related to online activities where trust is relevant and where there is potential for trust management. In some cases, trust management has been defined with specific meanings. In other cases, there are well established disciplines with different names that could also be called trust management. Despite the confusion in terminology, trust management, as a general approach, represents a promising development for making online transactions more dependable, and in the long term for increasing the social capital of online communities.http://www.bibsonomy.org/bibtex/244adf70d956f525daef077ec4349edd8/dawincidawinci2008-07-17T15:54:37+02:00trust e-commerce soft_security reputation social_control security <span style="color:#555555;">Lars <a href="http://www.bibsonomy.org/author/Rasmusson">Rasmusson</a> and Sverker <a href="http://www.bibsonomy.org/author/Jansson">Jansson</a> </span><em>NSPW '96: Proceedings of the 1996 workshop on New security paradigms, </em><em>page18--25. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>1996</em>)Thu Jul 17 15:54:37 CEST 2008New York, NY, USANSPW '96: Proceedings of the 1996 workshop on New security paradigms18--25Simulated Social Control for Secure Internet Commerce1996trust e-commerce soft_security reputation social_control security In this paper we suggest that soft security such as social control has to be used to create secure open systems. Social control means that it is the participants themselves who are responsible for the security, as opposed to leaving the security to some external or global authority. Social mechanisms don't deny the existence of malicious participants. Instead they are aiming at avoiding interaction with them. This makes them more robust than hard security mechanisms such as passwords, who reveal everything if they are bypassed. We describe our work in progress of constructing a workbench to run simulations of electronic markets. By examining the success of different security mechanisms to avoid maliciously behaving actors we hope to gain insight into how to create electronic markets. The idea of creating reputations for the participants is discussed. Finally some legal aspects on using social control and reputation as security mechanisms are discussed. Information Networks and Social Trust by Allan Friedmanhttp://www.bibsonomy.org/bibtex/217a7766ca20de6751353764495d395c1/sonrientesonriente2008-07-08T09:46:32+02:00signaling networks lv_crossmedia_4 convegence information trust social_networks security <span style="color:#555555;">ALLAN A. <a href="http://www.bibsonomy.org/author/FRIEDMAN">FRIEDMAN</a> </span><em>Harvard University - John F. Kennedy School of Government, </em><em>22006. </em>Tue Jul 08 09:46:32 CEST 20082Information Networks and Social Trust2006signaling networks lv_crossmedia_4 convegence information trust social_networks security Social networks can embed the necessary social information to aid in critical trust failures in Internet security. This paper argues that trust in an electronic environment is best served, not by increased complexity and new mental models, but by leveraging existing social forces. A mechanism for leveraging such trust is summarized and then modeled using an agent-based simulation. A new model of social networks based on theory and empirical results is presented and used to demonstrate the efficacy of a social-network based signaling mechanism. Simulation demonstrates that trust and common assumptions about social behavior can be leveraged to detect bad resources even in a naïve population, although some initial source of information is required.http://www.bibsonomy.org/bibtex/2c27a5b7b2089a126447edddfe5f9d44d/mquasthoffmquasthoff2008-07-04T10:27:12+02:00FOAF security semantic <span style="color:#555555;">Sebastian Ryszard <a href="http://www.bibsonomy.org/author/Kruk">Kruk</a> and Slawomir <a href="http://www.bibsonomy.org/author/Grzonkowski">Grzonkowski</a> and Adam <a href="http://www.bibsonomy.org/author/Gzella">Gzella</a> and Tomasz <a href="http://www.bibsonomy.org/author/Woroniecki">Woroniecki</a> and Hee-Chul <a href="http://www.bibsonomy.org/author/Choi">Choi</a> </span><em>ASWC, </em><em>volume4185ofLecture Notes in Computer Science, </em><em>page140-154. </em><em>Springer, </em>(<em>2006</em>)Fri Jul 04 10:27:12 CEST 2008ASWCDBLP:conf/aswc/2006140-154Lecture Notes in Computer ScienceD-FOAF: Distributed Identity Management with Access Rights Delegation41852006FOAF security semantic How valuable is external link evidence when searching enterprise Webs?http://www.bibsonomy.org/bibtex/25ed988a1f09acdf7144531f53a8ce25a/ewomantewomant2008-07-01T12:34:25+02:00security vertical_search datenschutz <span style="color:#555555;">David <a href="http://www.bibsonomy.org/author/Hawking">Hawking</a> and Francis <a href="http://www.bibsonomy.org/author/Crimmins">Crimmins</a> and Nick <a href="http://www.bibsonomy.org/author/Craswell">Craswell</a> and Trystan <a href="http://www.bibsonomy.org/author/Upstill">Upstill</a> </span><em>ADC '04: Proceedings of the 15th Australasian database conference, </em><em>page77--84. </em><em>Darlinghurst, Australia, Australia, </em><em>Australian Computer Society, Inc., </em>(<em>2004</em>)Tue Jul 01 12:34:25 CEST 2008Darlinghurst, Australia, AustraliaADC '04: Proceedings of the 15th Australasian database conference77--84How valuable is external link evidence when searching enterprise Webs?2004security vertical_search datenschutz Link information, especially anchor text, is known to be very useful for effective ranking of web pages, particularly in response to navigational queries. We investigated whether enterprise webs contain sufficient internal link information to adequately answer queries derived from the enterprise's site map or, alternatively, whether adding link evidence from the external Web can boost search effectiveness. Using 1266 navigational queries derived from Stanford University's A-Z site index, we found no difference between the quality of results returned by Stanford's Google appliance and those from an appropriately site-restricted search of the global Google service. Applying similar methodology to our own crawls of seven Australian organisations, we found that adding external link evidence made no significant difference to search effectiveness in five cases and a slight difference (in different directions) in the other two. We observed that external links to an organisation show very different patterns to internal links. Unlike enterprise web publishers, external web authors heavily favour directory default pages, particularly the organisation's home page and pages offering information or services likely to be useful on an ongoing basis. External links seldom reference the complex, parameterised URLs in common use in many organisations.http://www.bibsonomy.org/bibtex/2073b079a7206bcfb7a6ea0daf189e91d/cschenkcschenk2008-06-30T16:08:04+02:00isms 27000 system information iso security standards management norm article read:2008 ix bsi sicherheit zertifizierung <span style="color:#555555;">Alexander <a href="http://www.bibsonomy.org/author/Geschonneck">Geschonneck</a> </span><em>iX</em>(<em>2006</em>)Mon Jun 30 16:08:04 CEST 2008iX114-115Messbar. Neue Standards für Informationssicherheit12006isms 27000 system information iso security standards management norm article read:2008 ix bsi sicherheit zertifizierung http://www.bibsonomy.org/bibtex/286c9d0a9bbfb3839a455ae78dd0eb5f6/chestevechesteve2008-06-28T22:09:04+02:00ngi security hash <span style="color:#555555;">Tilman <a href="http://www.bibsonomy.org/author/Wolf">Wolf</a> </span><em>Proc. of the 2007 IEEE Conference on Military Communications (MILCOM), </em><em>Orlando, FL, </em><em>October2007. </em>Sat Jun 28 22:09:04 CEST 2008Orlando, FLProc. of the 2007 IEEE Conference on Military Communications (MILCOM)OctoberA Credential-Based Data Path Architecture for Assurable Global Networking2007ngi security hash http://www.bibsonomy.org/bibtex/2f5b47ef6e77ee4a7be5ab0a75d42da39/lolownialolownia2008-06-25T18:49:30+02:00security <span style="color:#555555;">Matt <a href="http://www.bibsonomy.org/author/Bishop">Bishop</a> and David <a href="http://www.bibsonomy.org/author/Bailey">Bailey</a> </span>(<em>1996</em>)Wed Jun 25 18:49:30 CEST 2008A Critical Analysis of Vulnerability Taxonomies1996security http://www.bibsonomy.org/bibtex/204407b28e3ec42df5c23845126b9c04b/lolownialolownia2008-06-25T18:48:39+02:00security <span style="color:#555555;">William <a href="http://www.bibsonomy.org/author/Stallings">Stallings</a> </span><em>Prentice Hall, </em><em>Upper Saddle River, </em>(<em>1995</em>)Wed Jun 25 18:48:39 CEST 2008Upper Saddle RiverNetwork and Internetwork Security: Principles and Practice1995security http://www.bibsonomy.org/bibtex/28178c6e5761fa1be4e6feffdb0bb2194/lolownialolownia2008-06-25T17:31:17+02:00security <span style="color:#555555;">Carl E. <a href="http://www.bibsonomy.org/author/Landwehr">Landwehr</a> and Alan R. <a href="http://www.bibsonomy.org/author/Bull">Bull</a> and John P. <a href="http://www.bibsonomy.org/author/McDermott">McDermott</a> and William S. <a href="http://www.bibsonomy.org/author/Choi">Choi</a> </span><em>ACM Comput. Surv.</em>(<em>1994</em>)Wed Jun 25 17:31:17 CEST 2008New York, NY, USAACM Comput. Surv.3A taxonomy of computer program security flaws261994security http://www.bibsonomy.org/bibtex/2548fdd4a6fc38eeeb0a2c39242722186/dawincidawinci2008-06-24T10:38:53+02:00identity privacy laws security data_minimization canada internet identity_management <span style="color:#555555;">Ann <a href="http://www.bibsonomy.org/author/Cavoukian">Cavoukian</a> </span><em>Office of the Information and Privacy Commissioner, </em><em>Ontaria, Canada, </em><em>October2006. </em>Tue Jun 24 10:38:53 CEST 2008Ontaria, CanadaOctober7 Laws of Identity - The Case for Privacy-Embedded Laws of Identity in the Digital Age2006identity privacy laws security data_minimization canada internet identity_management Privacy is at risk in a networked world of interoperable digital identifiers. This paper advocates embedding privacy early into identity management systems and technologies. Adoption of the 7 Laws of Identity offers strong potential for computer users to combat online fraud, minimize disclosure of their personal information, and assume greater control over their privacy when online. The result is a win-win for both consumers and e-commerce.dblphttp://www.bibsonomy.org/bibtex/2dff79bb3a13f072bc77089db80de0878/ewomantewomant2008-06-21T14:36:00+02:00privacy enterprise security vertical_search <span style="color:#555555;">Aameek <a href="http://www.bibsonomy.org/author/Singh">Singh</a> and Mudhakar <a href="http://www.bibsonomy.org/author/Srivatsa">Srivatsa</a> and Ling <a href="http://www.bibsonomy.org/author/Liu">Liu</a> </span><em>ICWS, </em><em>page18-25. </em><em>IEEE Computer Society, </em>(<em>2007</em>)Sat Jun 21 14:36:00 CEST 2008ICWSconf/icws/200718-25Efficient and Secure Search of Enterprise File Systems.2007privacy enterprise security vertical_search http://www.bibsonomy.org/bibtex/2ca75c5b0171e0145fec698fcb7bf4b3a/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00Cryptography Security genetic programming, and algorithms, <span style="color:#555555;">Ajith <a href="http://www.bibsonomy.org/author/Abraham">Abraham</a> and Ravi <a href="http://www.bibsonomy.org/author/Jain">Jain</a> </span><em>OSU, </em><em>13 May 20042004. </em>Thu Jun 19 17:35:00 CEST 200813 May 2004Journal-ref: Soft Computing in Knowledge Discovery: Methods and Applications, Saman Halgamuge and Lipo Wang (Eds.), Studies in Fuzziness and Soft Computing, Springer Verlag Germany, Chapter 16, 20 pages, 2004Soft Computing Models for Network Intrusion Detection Systems2004Cryptography Security genetic programming, and algorithms, Security of computers and the networks that connect them is increasingly becoming of great significance. Computer security is defined as the protection of computing systems against threats to confidentiality, integrity, and availability. There are two types of intruders: external intruders, who are unauthorised users of the machines they attack, and internal intruders, who have permission to access the system with some restrictions. This chapter presents a soft computing approach to detect intrusions in a network. Among the several soft computing paradigms, we investigated fuzzy rule-based classifiers, decision trees, support vector machines, linear genetic programming and an ensemble method to model fast and efficient intrusion detection systems. Empirical results clearly show that soft computing approach could play a major role for intrusion detection.http://www.bibsonomy.org/bibtex/2e7b78aa449c0c68ce3ac3b0e0c3fa0e5/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00additive selection, extraction, noise, text-independent networks verification, telephone security algorithms, speaker feature recognition, network convolutive remote genetic robust programming, <span style="color:#555555;">Peter <a href="http://www.bibsonomy.org/author/Day">Day</a> and Asoke K. <a href="http://www.bibsonomy.org/author/Nandi">Nandi</a> </span><em>IEEE Transactions on Audio, Speech and Language Processing</em><em>15(1):285--295</em><em>January2007. </em>Thu Jun 19 17:35:00 CEST 2008IEEE Transactions on Audio, Speech and Language ProcessingJanuary1285--295Robust Text-Independent Speaker Verification Using Genetic Programming152007additive selection, extraction, noise, text-independent networks verification, telephone security algorithms, speaker feature recognition, network convolutive remote genetic robust programming, Robust automatic speaker verification has become increasingly desirable in recent years with the growing trend toward remote security verification procedures for telephone banking, bio-metric security measures and similar applications. While many approaches have been applied to this problem, genetic programming offers inherent feature selection and solutions that can be meaningfully analysed, making it well suited to this task. This paper introduces a genetic programming system to evolve programs capable of speaker verification and evaluates its performance with the publicly available TIMIT corpora. We also show the effect of a simulated telephone network on classification results which highlights the principal advantage, namely robustness to both additive and convolutive noisehttp://www.bibsonomy.org/bibtex/26bc318be4793aaf118630cc1579b6617/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00crossover, Pattern security Intrusion programming, algorithms, recognition, Cyberterrorism, Homologous Information genetic detection, <span style="color:#555555;">James V. <a href="http://www.bibsonomy.org/author/Hansen">Hansen</a> and Paul Benjamin <a href="http://www.bibsonomy.org/author/Lowry">Lowry</a> and Rayman D. <a href="http://www.bibsonomy.org/author/Meservy">Meservy</a> and Daniel M. <a href="http://www.bibsonomy.org/author/McDonald">McDonald</a> </span><em>Decision Support Systems</em><em>43(4):1362--1374</em><em>August2007. </em><em>Special Issue Clusters . </em>Thu Jun 19 17:35:00 CEST 2008Decision Support SystemsAugustSpecial Issue Clusters41362--1374Genetic programming for prevention of cyberterrorism through dynamic and evolving intrusion detection432007crossover, Pattern security Intrusion programming, algorithms, recognition, Cyberterrorism, Homologous Information genetic detection, Because malicious intrusions into critical information infrastructures are essential to the success of cyberterrorists, effective intrusion detection is also essential for defending such infrastructures. Cyberterrorism thrives on the development of new technologies; and, in response, intrusion detection methods must be robust and adaptive, as well as efficient. We hypothesise that genetic programming algorithms can aid in this endeavour. To investigate this proposition, we conducted an experiment using a very large dataset from the 1999 Knowledge Discovery in Database (KDD) Cup data, supplied by the Defense Advanced Research Projects Agency (DARPA) and MIT's Lincoln Laboratories. Using machine-coded linear genomes and a homologous crossover operator in genetic programming, promising results were achieved in detecting malicious intrusions. The resulting programs execute in real time, and high levels of accuracy were realised in identifying both positive and negative instances.http://www.bibsonomy.org/bibtex/29ca81c8aa316c03d6bfc1dd71740e715/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00programming, algorithms, and Cryptology Computation genetic Security Computer in Evolutionary <span style="color:#555555;">Julio Cesar <a href="http://www.bibsonomy.org/author/Hernandez">Hernandez</a> and Pedro <a href="http://www.bibsonomy.org/author/Isasi">Isasi</a> and Andre <a href="http://www.bibsonomy.org/author/Seznec">Seznec</a> </span><em>Proceedings of the 2004 IEEE Congress on Evolutionary Computation, </em><em>page1510--1516. </em><em>Portland, Oregon, </em><em>IEEE Press, </em><em>20-23 June2004. </em>Thu Jun 19 17:35:00 CEST 2008Portland, OregonProceedings of the 2004 IEEE Congress on Evolutionary Computation20-23 June1510--1516On the design of state-of-the-art pseudorandom number generators by means of genetic programming2004programming, algorithms, and Cryptology Computation genetic Security Computer in Evolutionary The design of pseudorandom number generators by means of evolutionary computation is a classical problem. To day, it has been mostly and better accomplished by means of cellular automata and not many proposals, inside or outside this paradigm, could claim to be both robust (passing many statistical tests, including the most demanding ones) and fast, as is the case of the proposal we present. Furthermore, we use a radically new approach, where our fitness function is not at all based in any measure of randomness, as is frequently the case in the literature, but of non-linearity. Efficiency is assured by using only very efficient operators, and by limiting the number of terminals in the Genetic Programming implementation.http://www.bibsonomy.org/bibtex/224921c8e497e9492a40006b3c084cdb6/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00systems, linear algorithms, Real-World security genetic intrusion Applications, attacks, programming, mimicry detection <span style="color:#555555;">Hilmi Gunes <a href="http://www.bibsonomy.org/author/Kayacik">Kayacik</a> and Malcolm <a href="http://www.bibsonomy.org/author/Heywood">Heywood</a> and Nur <a href="http://www.bibsonomy.org/author/Zincir-Heywood">Zincir-Heywood</a> </span><em>GECCO 2006: Proceedings of the 8th annual conference on Genetic and evolutionary computation, </em><em>2, </em><em>page1667--1674. </em><em>Seattle, Washington, USA, </em><em>ACM Press, </em><em>8-12 July2006. </em>Thu Jun 19 17:35:00 CEST 2008Seattle, Washington, USA{GECCO 2006:} Proceedings of the 8th annual conference on Genetic and evolutionary computation8-12 July1667--1674On evolving buffer overflow attacks using genetic programming22006systems, linear algorithms, Real-World security genetic intrusion Applications, attacks, programming, mimicry detection http://www.bibsonomy.org/bibtex/272cf7ee5f7d66e96cb347faabbc8f1fd/brazovayeyebrazovayeye2008-06-19T17:35:00+02:00programming security subset intrusion RSS-DSS data, real-world dataset anomaly programming, cost detection, functions, data (DSS), genetic fitness filtering, sets hierarchical large (artificial function, learning mining, training, of selection KDD-99 set,Dynamic dynamical intelligence), detection algorithm, algorithms, <span style="color:#555555;">Dong <a href="http://www.bibsonomy.org/author/Song">Song</a> and Malcolm I. <a href="http://www.bibsonomy.org/author/Heywood">Heywood</a> and A. <a href="http://www.bibsonomy.org/author/Nur Zincir-Heywood">Nur Zincir-Heywood</a> </span><em>IEEE Transactions on Evolutionary Computation</em><em>9(3):225--239</em><em>June2005. </em>Thu Jun 19 17:35:00 CEST 2008IEEE Transactions on Evolutionary ComputationJune3225--239Training genetic programming on half a million patterns: an example from anomaly detection92005programming security subset intrusion RSS-DSS data, real-world dataset anomaly programming, cost detection, functions, data (DSS), genetic fitness filtering, sets hierarchical large (artificial function, learning mining, training, of selection KDD-99 set,Dynamic dynamical intelligence), detection algorithm, algorithms, The hierarchical RSS-DSS algorithm is introduced for dynamically filtering large datasets based on the concepts of training pattern age and difficulty, while using a data structure to facilitate the efficient use of memory hierarchies. Such a scheme provides the basis for training genetic programming (GP) on a data set of half a million patterns in 15 min. The method is generic, thus, not specific to a particular GP structure, computing platform, or application context. The method is demonstrated on the real-world KDD-99 intrusion detection data set, resulting in solutions competitive with those identified in the original KDD-99 competition, while only using a fraction of the original features. Parameters of the RSS-DSS algorithm are demonstrated to be effective over a wide range of values. An analysis of different cost functions indicates that hierarchical fitness functions provide the most effective solutions.http://www.bibsonomy.org/bibtex/2bb60a389d8ec3eeb16eecdd3c711b2eb/dawincidawinci2008-06-18T15:20:40+02:00credentials privacy identity_management security <span style="color:#555555;">Steven <a href="http://www.bibsonomy.org/author/Gevers">Gevers</a> and Verslype <a href="http://www.bibsonomy.org/author/Verslype">Verslype</a> and Bart De <a href="http://www.bibsonomy.org/author/Decker">Decker</a> </span><em>WPES '07: Proceedings of the 2007 ACM workshop on Privacy in electronic society, </em><em>page60-63. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2007</em>)Wed Jun 18 15:20:40 CEST 2008New York, NY, USAWPES '07: Proceedings of the 2007 ACM workshop on Privacy in electronic society60-63Enhancing Privacy in Identity Management Systems2007credentials privacy identity_management security User-privacy in existing identity management systems (IMS) can be improved.Indeed, private credential systems offer privacy enhancing capabilities not yet included in current IMS; e.g. proving claims such as age > 18, with age an attribute. This paper introduces privacy enhanced claim URIs which enable to request personal data in a privacy friendly way. We show how many private credential capabilities can be achieved in current IMS without using private credentials and continue by showing how these URIs allow integration of private credential systems in Microsoft Cardspace. Since our approach is very simple and widely applicable, it allows to enhance privacy friendliness of today's online transactions.