Search results
Jump to navigation
Jump to search
Page title matches
- {{DISPLAYTITLE:''k''-anonymity}} ...nymity/paper3.pdf |title=Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression |last2=Sweeney | ...16 KB (2,201 words) - 19:24, 22 February 2025
Page text matches
- ...te=19 January 2014}}</ref><ref>L. Sweeney, Datafly: a system for providing anonymity in medical data. Database Security, XI: Status and Prospects, T. Lin and S. ...si-identifier]] QI = ( ''A''<sub>1</sub>, ..., ''A''<sub>n</sub> ), ''k''-anonymity constraint ''k''; domain generalization hierarchies DGH<sub>A<sub>i</sub></ ...5 KB (710 words) - 23:35, 9 December 2023
- {{DISPLAYTITLE:''k''-anonymity}} ...nymity/paper3.pdf |title=Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression |last2=Sweeney | ...16 KB (2,201 words) - 19:24, 22 February 2025
- ...ity of practical DC-net implementations, at the potential risk of reducing anonymity if colluding participants can split the secret sharing graph into separate ...<math>m</math> of ''trustees'' whose role is to help the users obtain that anonymity. In this topology, each of the <math>n</math> users shares a secret with e ...16 KB (2,357 words) - 18:15, 8 May 2024
- ...unade|last2=Dyo|first2=Vladimir|date=2020-12-25|title=Practical Hash-based Anonymity for MAC Addresses|pages=572–579|doi=10.5220/0009825105720579|isbn=978-989-7 # Truncating the resulting hash to achieve [[K-anonymity]] ...8 KB (1,139 words) - 22:44, 21 November 2024
- ...ial choice)|'''neutrality''']] - the names of the outcomes do not matter. Anonymity and neutrality cannot always be satisfied by a deterministic social choice ...12 KB (1,767 words) - 02:59, 8 August 2024
- * If a coherent apportionment rule is [[Anonymity (social choice)|''anonymous'']] and [[Balance (apportionment)|''balanced''] * If a coherent apportionment rule is [[Anonymity (social choice)|''anonymous'']], [[Concordance (apportionment)|''concordant ...14 KB (2,146 words) - 07:19, 2 December 2024
- ...singly, a dictatorship is a rule that does not satisfy non-dictatorship. [[Anonymity (social choice)|Anonymous voting rules]] automatically satisfy non-dictator ...4 KB (570 words) - 22:35, 17 October 2024
- ...rwarding several modifications, has showed moderate advances in protecting anonymity without compromising the integrity of the underlying utility of the observe ...10 KB (1,431 words) - 03:10, 15 February 2025
- Every apportionment method that is [[Anonymity (social choice)|anonymous]], exact and coherent, is also balanced.<ref>{{Ci ...4 KB (648 words) - 08:39, 4 January 2023
- *Anonymity, neutrality, ex-post PE and weakly-group-SP are incompatible (for ≥4 voters *Anonymity, neutrality, PE, individual-SP and individual-FS are incompatible (for ≥5 v ...25 KB (3,694 words) - 21:49, 28 December 2024
- ...highest approval ratings. It is [[Pareto efficient]], [[strategyproof]], [[Anonymity (social choice)|fair to voters]], and [[Neutrality (social choice)|fair to ...5 KB (694 words) - 21:31, 22 February 2025
- [[Category:Anonymity]] ...6 KB (797 words) - 12:57, 9 February 2025
- ...ares, Pukelsheim and Ramirez proved that very apportionment rule that is [[Anonymity (social choice)|anonymous]], [[Balance (apportionment)|balanced]], [[Concor ...6 KB (899 words) - 17:04, 19 October 2024
- ...veto votes (i.e., input one in a boolean-OR function) while preserving the anonymity of those who have voted. The protocol can be generalized to support a wider ...6 KB (930 words) - 21:23, 21 February 2025
- ...ack to the user.<ref name=":1" /> General privacy requirements include [[K-anonymity]], maximum area, and minimum area.<ref name=":12">{{cite journal |last1=Cho ...(computer scientist)|title=Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms |journal=IEEE Transactions on Mobile Computing ...55 KB (7,739 words) - 07:36, 21 December 2024
- * A rule is [[Anonymity (social choice)|anonymous]], strategyproof and Pareto-efficient for all sin * A rule is [[Anonymity (social choice)|anonymous]] and strategyproof for all single-peaked prefere ...15 KB (2,324 words) - 10:47, 16 September 2024
- ...not gain attention when it was published in 2014, due to Royen's relative anonymity and the fact that the proof was published in a [[predatory journal]].<ref n ...7 KB (935 words) - 07:19, 28 November 2024
- * '''[[Anonymity (social choice)|Anonymity]]''' (='''Symmetry''') means that the apportionment does not depend on the ...nts, or when the requirements are the same; if they are not the same, then anonymity should hold subject to the requirements being satisfied. ...35 KB (5,378 words) - 08:28, 2 February 2025
- * UPM is the only rule satisfying continuity, anonymity, strategyproofness and proportionality among all symmetric single-peaked pr * Every rule that satisfies IFS, unanimity, [[Anonymity (social choice)|anonymity]] and strategyproofness is a phantom-median mechanism with ''n''-1 phantoms ...29 KB (4,277 words) - 18:12, 24 November 2024
- ...irst=Micah |date=2009 |title=Coordinate-based routing for high performance anonymity |url=https://netdb.cis.upenn.edu/papers/msherr-dissertation.pdf |journal=Co ...19 KB (2,693 words) - 12:59, 5 October 2024