Redistricting is the process of grouping all census blocks within a region to form larger subdivisions, or districts. The process is typically subject to some hard rules and some (soft) preferences to improve fairness of the solution. Achieving public consensus on the fairness of proposed redistricting plans is highly desirable. Unfortunately, fair redistricting is a n NP hard optimization problem. The complexity of the process makes it even more challenging to convince the public of the fairness of the proposed solution. This paper proposes a completely transparent blockchain based strategy to promote public participation in the redistricting process, to increase public confidence in the outcome of the process. The proposed approach is based on the fact that one does not have to worry about how the NP hard problem was solved, as long as it is possible for anyone to compute a “goodness” metric for the proposed plan. In the proposed approach, anyone can submit a plan along with the expected metric. Only the plan with the best claimed metric need s to be evaluated in a blockchain network.
KeywordsRedistrictingAuthenticated Data StructuresBlockchain Ledger
Crocker, R. (2012) Congressional Redistricting: An Overview. CRS Report for Congress (R42831).
Altman, M. (1998) Districting Principles and Democratic Representation. Ph.D. Thesis, California Institute of Technology, Pasadena.
Saxon, J. (2020) Reviving Legislative Avenues for Gerrymandering Reform with a Flexible, Automated Tool. Political Analysis, 28, 372-394. https://doi.org/10.1017/pan.2019.45
Cohen-Addad, V., Klein, P.N. and Young, N.E. (2018) Balanced Centroidal Power Diagrams for Redistricting. Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, Seattle, 6-9 November 2018, 389-396. https://doi.org/10.1145/3274895.3274979
Altman, M. and McDonald, M.P. (2010) The Promise and Perils of Computers in Redistricting. Duke Journal of Constitutional Law & Public Policy, 5, 69-159.
United States Census Bureau. Topologically Integrated Geographic Encoding and Referencing (TIGER) Database. https://www.census.gov/geographies/mapping-files/time-series/geo/tiger-geodatabase-file.html
ESRI (1998) ESRI Shapefile Technical Description: An ESRI White Paper. https://www.esri.com/library/whitepapers/pdfs/shapefile.pdf
Rushby, J.M. (1981) Design and Verification of Secure Systems. 8th ACM Symposium on Operating System Principles, Pacific Grove, 14-16 December 1981, 12-21. https://doi.org/10.1145/800216.806586
Wei, J. and Pu, C. (2005) TOCTOU Vulnerabilities in UNIX-Style File Systems: An Anatomical Study. 4th USENIX Conference on File and Storage Technologies, San Francisco, 13-16 December 2005, 155-167.
Bright, P. (2018) Meltdown and Spectre: Here’s What Intel, Apple, Microsoft, Others Are Doing about It. Ars Technica.
De Lucia, M.J. (2017) A Survey on Security Isolation of Virtualization, Containers, and Unikernels. US Army Research Laboratory, ARL-TR-8029.
Percival, C. (2005) Cache Missing for Fun and Profit. BSDCan. https://www.bsdcan.org/2015/
Lipp, M., Gruss, D., Spreitzer, R., et al. (2016) ARMageddon: Cache Attacks on Mobile Devices. 25th USENIX Security Symposium, Austin, 10-12 August 2016, 549-564.
Saini, H., Rao, Y.S. and Panda, T.C. (2012) Cyber-Crimes and Their Impacts: A Review. International Journal of Engineering Research and Applications, 2, 202-209.
Larochelle, D. and Evans, D. (2001) Statically Detecting Likely Buffer Overflow Vulnerabilities. 10th USENIX Security Symposium, Washington DC, 13-17 August 2001, 177-190.
Patten, D. (2017) The Evolution to Fileless Malware. http://www.infosecwriters.com/Papers/DPatten Fileless.pdf
Stewin, P. and Bystrov, I. (2012) Understanding DMA Malware. International Conference on Detection of Intrusions and Malware, and Vulnerability Assessment, c, d, 21-41. https://doi.org/10.1007/978-3-642-37300-8_2
Samyde, D., Skorobogatov, S., Anderson, R. and Quisquater, J.J. (2002) On a New Way to Read Data from Memory. First International IEEE Proceedings of Security in Storage Workshop, 11 December 2002, 65-69.
Ramkumar, M. (2018) Scalable Computing in a Blockchain. 2018 IEEE 39th Sarnoff Symposium, Newark, NJ, 24-25 September 2018, 1-6. https://doi.org/10.1109/SARNOF.2018.8720499
Dotan, M., Pignolet, Y.A., Schmid, S., et al. (2021) Survey on Blockchain Networking: Context, State-of-the-Art, Challenges. ACM Computing Surveys, 54, Article No. 107. https://doi.org/10.1145/3453161
Ramkumar, M. (2018) Executing Large Scale Processes in a Blockchain. Journal of Capital Market Studies, 2, 106-120. https://doi.org/10.1108/JCMS-05-2018-0020
Hendrix, E.M.T. and Toth, B.G. (2010) Goodness of Optimization Algorithms. In: Introduction to Nonlinear and Global Optimization, Springer, New York, 67-90. https://doi.org/10.1007/978-0-387-88670-1_4
Braden, B. (1986) The Surveyor’s Area Formula. The College Mathematics Journal, 17, 326-337. https://doi.org/10.1080/07468342.1986.11972974
Bourke, P. (1988) Calculating the Area and Centroid of a Polygon. http://paulbourke.net/geometry/polygonmesh/
Reock Jr., E.C. (1961) A Note: Measuring Compactness as a Requirement of Legislative Apportionment. Midwest Journal of Political Science, 5, 70-74. https://doi.org/10.2307/2109043
Polsby, D. and Popper, R. (1991) The Third Criterion: Compactness as a Procedural Safeguard against Partisan Gerrymandering. Yale Law & Policy Review, 9, 301-353. https://doi.org/10.2139/ssrn.2936284
Young, H.P. (1988) Measuring the Compactness of Legislative Districts. Legislative Studies Quarterly, 13, 105-115. https://doi.org/10.2307/439947
Anagnostopoulos, A., Goodrich, M.T. and Tamassia, R. (2001) Persistent Authenticated Dictionaries and Their Applications. Proceedings of the 4th International Conference on Information Security, Malaga, 1-3 October 2001, 379-393. https://doi.org/10.1007/3-540-45439-X_26
Martel, C., Nuckolls, G., Devanbu, P., Gertz, M., Kwong, A. and Stubblebine, S. (2001) A General Model for Authentic Data Publication. VC Davis Department of Computer Science Technical Report.
Ramkumar, M. (2014) Symmetric Cryptographic Protocols. Springer, Berlin. https://doi.org/10.1007/978-3-319-07584-6
Adhikari, N., Bushra, N. and Ramkumar, M. (2019) Complete Merkle Hash Trees for Large Dynamic Spatial Data. 2019 International Conference on Computational Science and Computational Intelligence (CSCI’19), Las Vegas, 5-7 December 2019, 1318-1323. https://doi.org/10.1109/CSCI49370.2019.00246
Chelladurai, U. and Pandian, S. (2021) HARE: A New Hash-Based Authenticated Reliable and Efficient Modified Merkle Tree Data Structure to Ensure Integrity of Data in the Healthcare Systems. Journal of Ambient Intelligence and Humanized Computing, 1-15. https://doi.org/10.1007/s12652-021-03085-0
Merkle, R.C. (1987) A Digital Signature Based on a Conventional Encryption Function. In: Pomerance, C., Ed., Advances in Cryptology—CRYPTO’87. CRYPTO 1987. Lecture Notes in Computer Science, Vol. 293. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48184-2_32
Adhikari, N. (2020) Authoritative and Unbiased Responses to Geographic Queries. Ph.D. Thesis, Mississippi State University, Starkville.
Xiao, Y., Zhang, N., Lou, W. and Hou, Y.T. (2020) A Survey of Distributed Consensus Protocols for Blockchain Networks. IEEE Communications Surveys & Tutorials, 22, 1432-1465. https://doi.org/10.1109/COMST.2020.2969706
Nakamoto, S. (2008) A Peer-to-Peer Electronic Cash System. Bitcoin.org.
Buterin, V. (2015) A Next-Generation Smart Contract and Decentralized Application Platform. Ethereum White-Paper, 36 p.
Adhikari, N., Bushra, N. and Ramkumar, M. (2019) Redistricting Using Blockchain Network. 2019 First IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA), Los Angeles, 12-14 December 2019, 150-159. https://doi.org/10.1109/TPS-ISA48467.2019.00026
Shamos, M.I. and Hoey, D. (1976) Geometric Intersection Problems. 17th Annual Symposium on Foundations of Computer Science (SFCS 1976), Houston, 25-27 October 1976, 208-215. https://doi.org/10.1109/SFCS.1976.16