Electronic Know Your Customer (E-KYC) is an essential process that is widely used to verify the identities of customers for various purposes.However, traditional E-KYC methods have several limitations, including security and privacy concerns.In this paper, we propose a secured and privacy-preserving E-KYC system using blockchain technology.The proposed system utilizes the security and immutability of the blockchain network to store customer information securely and ensure that it cannot be tampered with.The system also utilizes smart contracts to automate the E-KYC process while ensuring the privacy of customer information.Additionally, we propose the use of a zero-knowledge proof protocol to enable users to prove their identity without revealing their personal information.
Threshold signatures are a fundamental cryptographic primitive used in many practical applications. As proposed by Boneh and Komlo (CRYPTO'22), TAPS is a threshold signature that is a hybrid of privacy and accountability. It enables a combiner to combine t signature shares while revealing nothing about the threshold t or signing quorum to the public and asks a tracer to track a signature to the quorum that generates it. However, TAPS has three disadvantages: it 1) structures upon a centralized model, 2) assumes that both combiner and tracer are honest, and 3) leaves the tracing unnotarized and static. In this work, we introduce Decentralized, Threshold, dynamically Accountable and Private Signature (DeTAPS) that provides decentralized combining and tracing, enhanced privacy against untrusted combiners (tracers), and notarized and dynamic tracing. Specifically, we adopt Dynamic Threshold Public-Key Encryption (DTPKE) to dynamically notarize the tracing process, design non-interactive zero knowledge proofs to achieve public verifiability of notaries, and utilize the Key-Aggregate Searchable Encryption to bridge TAPS and DTPKE so as to awaken the notaries securely and efficiently. In addition, we formalize the definitions and security requirements for DeTAPS. Then we present a generic construction and formally prove its security and privacy. To evaluate the performance, we build a prototype based on SGX2 and Ethereum.
Yang Liu, Liangjie Lin, Lin Jiang, Weizhe Zhang · 9 authors
Abstract In the era of digital marketing, advertisements have become an indispensable part. One of the central challenges is advertising attribution which explains the amount of contribution every publisher has with the conversions. However, through observation, we have found that current advertising platforms attribution, advertisers attribution, or third‐party platforms attribution all have the problems of trust, data leakage, and data forgery. To fill the gap, our work's main contribution is combining blockchain with advertising attribution to propose an architecture for improving the privacy‐preserving degree and amount. In the proposed architecture, publishers, and advertisers can store real‐time data on a blockchain. The attribution results are credible because blockchain is decentralized, tamper‐proof, and traceable. We combine privacy set intersection and zero‐knowledge proof technology to increase the privacy of flowing data. In addition, we describe a preliminary prototype in which publishers, advertisers, and advertising platforms can get the corresponding attribution details. To show its effectiveness, we analyze it from different perspectives, including communication cost, attribution accuracy, and time cost. The results show that our communication cost has significantly reduced compared to the recent studies.
Junrui Liu, Ian Kretz, Hanzhi Liu, Bryan E‐Xin Tan · 10 authors
Zero-knowledge (ZK) proof systems have emerged as a promising solution for building security-sensitive applications. However, bugs in ZK applications are extremely difficult to detect and can allow a malicious party to silently exploit the system without leaving any observable trace. This paper presents Coda, a novel statically-typed language for building zero-knowledge applications. Critically, Coda makes it possible to formally specify and statically check properties of a ZK application through a rich refinement type system. One of the key challenges in formally verifying ZK applications is that they require reasoning about polynomial equations over large prime fields that go beyond the capabilities of automated theorem provers. Coda mitigates this challenge by generating a set of Coq lemmas that can be proven in an interactive manner with the help of a tactic library. We have used Coda to re-implement 77 arithmetic circuits from widely-used Circom libraries and applications. Our evaluation shows that Coda makes it possible to specify important and formally verify correctness properties of these circuits. Our evaluation also revealed 6 previously-unknown vulnerabilities in the original Circom projects.
Since the concern of privacy leakage extremely discourages user participation in sharing data, federated learning has gradually become a promising technique for both academia and industry for achieving collaborative learning without leaking information about the local data. Unfortunately, most federated learning solutions cannot efficiently verify the execution of each participant's local machine learning model and protect the privacy of user data, simultaneously. In this article, we first propose a Zero-Knowledge Proof-based Federated Learning (ZKP-FL) scheme on blockchain. It leverages zero-knowledge proof for both the computation of local data and the aggregation of local model parameters, aiming to verify the computation process without requiring the plaintext of the local data. We further propose a Practical ZKP-FL (PZKP-FL) scheme to support fraction and non-linear operations. Specifically, we explore a Fraction-Integer mapping function, and use Taylor expansion to efficiently handle non-linear operations while maintaining the accuracy of the federated learning model. We also analyze the security of PZKP-FL. Performance analysis demonstrates that the whole running time of the PZKP-FL scheme is approximately less than one minute in parallel execution.
Farhan Shikalgar, Farhaan Khan, Saud Kadiri, Anas Khan
Improving efficiency and performance is an important topic in the world today. As it is well-known, cooperative computing is an effective and traditional approach, and it is widely used in various fields. Inspired by this idea, take E- commerce for example, Security is one of its important indicators. In E-commerce, the security technology has become a major issue restricting the rapid development and popularization of E- commerce.With the advent of new technologies, Blockchain plays a major role in ecommerce sector.With the characteristics of decentralization, persistency, anonymity and auditability, blockchain technology is a new tool to solve the product traceability, information security and privacy, payment efficiency and cost reduction in cross- border e-business.Existing E-commerce models are trapped in a dilemma between the proof of ownership and privacy protection. To address this issue,We have made a platform Shoppingverse which is a blockchain based ecommerce.we design a privacy-preserving business protocol by employing private smart contracts in the negotiation phase. The protocol allows counterparties make deals without the disclosure of private information such as identities, addresses, and phone numbers. Moreover, we employ the zero- knowledge proof to guarantee the ownership. Key Words: Ethereum, Blockchain, Ecommerce, Smart Contract.
The tasks of education renewal, which are related to the revision of its content and pedagogy for sustainable development, are considered. The complexity of these tasks and their historical unprecedentedness are emphasized. The possibilities of digital technology in education in solving these problems are justified. The advantages of artificial intelligence, blockchain and zero-knowledge proof when combined to become education for sustainable development are analyzed. The most promising areas for their use in the renewal of education are listed.
Abdul Qawi Jalili, Anton Dziatkovskii, Platinum VC & Incubator Australia
This research paper aims to elucidate the intricate relationship between artificial intelligence (AI), state data security, and the volatile circumstances induced by sanctions and economic pressure. By undertaking a comprehensive literature review, the study not only offers a historical context of state data security mechanisms but also delves deeply into the advancements provided by AI-driven solutions. The work serves as a crucial reference for policymakers, cybersecurity experts, and academic researchers, laying a foundation for the nuanced understanding of AI’s capabilities and limitations within the realms of state data security and economic stressors. Employing an analytical framework, the paper systematically distills knowledge from a wide array of sources, including academic articles, technical reports, policy briefs, and international standards. This multidimensional analysis allows for a holistic understanding of the state-of-the-art AI technologies, their applicability in fortifying state data security, and the ethical labyrinth that states must navigate. Paper underscores a multitude of challenges and ethical considerations that are often overshadowed by the technological prowess of AI. These encompass issues such as data privacy infringement, potential for mass surveillance, and ethical quandaries around bias and discrimination. The paper also throws light on the pivotal factors of accountability and transparency, essential for maintaining public trust in AI-augmented state security mechanisms. The study raises awareness about AI-driven cyber threats, focusing on the paradox of employing AI to enhance security while also becoming susceptible to advanced AI-driven cyberattacks. Paper addresses the long-term sustainability and resilience of AI-enabled security measures, particularly in the context of evolving cyber threats and the inherent instability brought about by economic pressures and sanctions. The resilience of AI algorithms and systems under these specific conditions is scrutinized, offering a forward-looking perspective on the adaptability and robustness of AI technologies in safeguarding state data.
As the main food source of the world's population, grain quality safety is of great significance to the healthy development of human beings. The grain food supply chain is characterized by its long life cycle, numerous and complex business data, difficulty defining private information, and difficult managing and sharing. In order to strengthen the ability of information application processing and coordination of the grain food supply chain under many risk factors, an information management model suitable for the grain food supply chain is studied based on the blockchain multi-chain technology. First, the information on key links in the grain food supply chain is analyzed to obtain privacy data classifications. Second, a multi-chain network model of the grain food supply chain is constructed, and based on this model, the hierarchical encryption and storage mode of private data as well as the relay cross-chain communication mode, are designed. In addition, a complete consensus process, including CPBFT, ZKP, and KZKP algorithms, is designed for the global information collaborative consensus under the multi-chain architecture. Finally, the model is verified through performance simulation, theory analysis, and prototype system verification in terms of its correctness, security, scalability, and consensus efficiency. The results show that this research model effectively reduces the storage redundancy and deals with problems of data differential sharing in traditional single-chain research, as well as provides a secure data protection mechanism, a credible data interaction mechanism, and an efficient multi-chain collaborative consensus mechanism. By attempting to apply blockchain multi-chain technology to the grain food supply chain, this study provides new research ideas for the trusted protection of data and information collaborative consensus in this field.
The problem of determining the position relationship between points and polygons is very extensive in practical applications. However, the existing solutions are only applicable to the case of convex polygons, and no solutions are given for arbitrary polygons. In addition, most of the existing schemes are carried out under the semi-honest model, and cannot resist the active attack of malicious adversaries. In order to solve these problems, this paper uses Paillier's encryption scheme, the idea of zero-knowledge proof to design a decision protocol to protect the position relationship between points and arbitrary polygons, which can not only prevent the deceptive behavior of malicious adversaries, but also extend the application from convex polygons to arbitrary polygons. A simulation example is used to prove that this paper is safe and efficient under the malicious model.
Given that reliable cloud quantum computers are becoming closer to reality, the concept of delegation of quantum computations and its verifiability is of central interest. Many models have been proposed, each with specific strengths and weaknesses. Here, we put forth a new model where the client trusts only its classical processing, makes no computational assumptions, and interacts with a quantum server in a single round. In addition, during a set-up phase, the client specifies the size $n$ of the computation and receives an untrusted, off-the-shelf (OTS) quantum device that is used to report the outcome of a single measurement. We show how to delegate polynomial-time quantum computations in the OTS model. This also yields an interactive proof system for all of QMA, which, furthermore, we show can be accomplished in statistical zero-knowledge. This provides the first relativistic (one-round), two-prover zero-knowledge proof system for QMA. As a proof approach, we provide a new self-test for n EPR pairs using only constant-sized Pauli measurements, and show how it provides a new avenue for the use of simulatable codes for local Hamiltonian verification. Along the way, we also provide an enhanced version of a well-known stability result due to Gowers and Hatami and show how it completes a common argument used in self-testing.
Mayawi Baba-Nalikant, Nor Athiyah Abdullah, Mohd Heikal Husin, Sharifah Mashita Syed-Mohamad · 6 authors
This study aimed to investigate the relationships between knowledge, attitudes, and values in promoting zero-waste, pro-environmental behaviour among the university campus community and how technology plays its role. A survey instrument was developed from the findings of earlier focus group discussions and in-depth interviews, which were based on the adaptation and adoption of previous studies, especially Kollmuss and Agyeman’s 2002 Model of Pro-Environmental Behaviour and a modified Knowledge-Attitude-Practises Model. Three hundred ninety-three respondent samples from Universiti Kebangsaan Malaysia, Universiti Putra Malaysia, and Universiti Sains Malaysia were analysed for their insights regarding their vision of a Zero-Waste Campus using the Structural Equation Modelling approach. The results show positive relationships between the five studied variables and the proposed hypotheses. Knowledge and attitudes serve as moderating variables, enhancing the strength of the causal effects of the related relationships. As the results show good significance, proper planning for integrating the studied variables and the proposed zero-waste campus framework can be used by university management, other institutions, or national-level agencies to develop an environment-specific plan to promote zero-waste, pro-environmental behaviour.
Travis C. Cuvelier, Takashi Tanaka, Robert W. Heath
We propose an adaptive coding approach to achieve linear-quadratic-Gaussian (LQG) control with near-minimum bitrate prefix-free feedback. Our approach combines a recent analysis of a quantizer design for minimum rate LQG control with work on universal lossless source coding for sources on countable alphabets. In the aforementioned quantizer design, it was established that the quantizer outputs are an asymptotically stationary, ergodic process. To enable LQG control with provably near-minimum bitrate, the quantizer outputs must be encoded into binary codewords efficiently. This is possible given knowledge of the probability distributions of the quantizer outputs, or of their limiting distribution. Obtaining such knowledge is challenging; the distributions do not readily admit closed form descriptions. This motivates the application of universal source coding. Our main theoretical contribution in this work is a proof that (after an invertible transformation), the quantizer outputs are random variables that fall within an exponential or power-law envelope class (depending on the plant dimension). Using ideas from universal coding on envelope classes, we develop a practical, zero-delay version of these algorithms that operates with fixed precision arithmetic. We evaluate the performance of this algorithm numerically, and demonstrate competitive results with respect to fundamental tradeoffs between bitrate and LQG control performance.
Ring Confidential Transactions (RingCT) is a protocol associated with the privacy-focused cryptocurrency Monero and is used to hide the transaction amount from the third party while still providing the confidentiality of the hide transaction. With the Pederson commitment scheme, ring signature, and other cryptographic constructions, RingCT plays a major role in making the transactions of Monero private. As a privacy coin, Monero has the unique property of fungibility in the cryptocurrency market from the protocols implemented. These protocols provided opportunities and challenges for its future. In this paper, the version of the protocol implemented in Monero is first inspected, including the commitment to zero and the range proof. Then, two critical cryptographic constructions used by RingCT 2.0, the accumulator and the signature of knowledge, are introduced. Finally, the influence of RingCT and other privacy features and the current situation of privacy coin is discussed.
The two main forms of healthcare data exchange among entities are business-to-business (B2B) and business-to-customer (B2C). The former uses the electronic data interchange (EDI) technology between healthcare institutions, while the latter is usually conducted by providing web-based interfaces for patients. This research argues that both forms have inherent security and privacy weaknesses. Furthermore, patients lack appropriate transparency and control over their own Personally Identifiable Information (PII). We explore the issues of medical record exchange, analyze them and suggest appropriate solutions in the form of a new model to mitigate them. The vulnerabilities, ranging from critical to minor, include the possibility of Man-in-The-Middle (MiTM) and supply chain attacks, weak cryptography, repudiable transactions, single points of failure (SPOF), and poor access controls. A novel model will be presented in this research for healthcare data sharing which applies the best security practices. The proposed unified model will counter the listed vulnerabilities. It automates the healthcare processes in decentralized architecture by utilizing the smart contracts for B2C transactions such as medicine purchase. The model is based on the Blockchain and zero-knowledge proofs. It is made with novel controls which represent the latest advancements in cybersecurity. It has the potential of setting a new cornerstone.
Abstract: Blockchain allows users and data providers to ensure authentication, authorization and data validity with proper multi-key exchange authentication for user identity and hash key for Blockchain so that the data is not just stored but also validated each time the user access. In this paper, we apply Zero Knowledge proof to a Strong rooms using RFID Card reader and Camera module IoT systems to prove that a prover without disclosing information such as public key enhances the anonymity of Blockchain
Redento B. Recio, Erich Wolff, Ashraful Alam, Sanjeev Routray · 8 authors
… the right to be counted is a struggle for legibility, visibility, and enlisting; it is a contingent and contextual struggle to lay claims to space and infrastructure in the city. (Routray, 2022a, p. 267). As signalled in the above quote, The Right to be Counted offers a unique perspective into the tactics deployed by communities to achieve urban citizenship in India. The book is structured around eight chapters and guides the reader through an investigation of how ‘the poor respond to the contradictory intentions and goals of various state agencies by either partaking in or subverting the quotidian practices of the state’ (Routray, 2022a, p. 266). It does so by delving into the experiences of the urban poor, who are portrayed as active agents in the production of new forms of citizenship in response to calculative state governmentality. The book is theoretically solid and empirically grounded and contributes to the literature on the right to the city. Centred on the concept of ‘numerical citizenship’, the book sheds light on how the urban poor struggle to be seen and accounted for in contemporary Delhi. Numerical citizenship is ‘the systematic, protracted, and incremental political process by which the poor become entrenched in the city’ (Routray, 2022a, p. 2). It involves the struggle of the urban poor ‘to be visible, to be identified, and to be recognised, and to be made eligible for food, shelter, and basic amenities and infrastructure in the city’ (Routray, 2022a, p. 2). The urban poor's incremental efforts to become visible to the local state are characterised by complex relationships in which the urban poor sometimes operate within the purview of state calculative governmentality and sometimes challenge and subvert governmental plans. In this sense, the book offers a timely and provocative expansion of the ideas of insurgent citizenship and other forms of representation as proposed by key authors such as James Holston (2009) and Asef Bayat (2000). The book draws on ethnographic insights to develop a series of arguments regarding numerical citizenship. Against a backdrop of the daily practices and institutionalised tactics deployed by city residents, the experiences discussed in the book illustrate how bureaucratic frameworks are applied in practice and how communities respond to them. In doing so, the book reveals how communities find ways to counter technocratic visions of the city and the processes that shape urbanisation (Wolff, 2020). These community narratives serve as immersive explorations of what it means to fight for recognition and access to public services for the residents of India and, to some extent, for millions of people in the Global South. The key arguments in this ethnographically rich volume contribute to the ongoing SEED conversation series focused on scholarship from peripheralised places, unpacking the spatial politics of uneven geographies of North and South as well as bringing marginalised indigenous, racial, sexual, gendered and ‘other’ narratives to the fore. SEED, the Space for Engagement and Epistemic Diversity, is an international platform hosted within the University of Melbourne's Informal Urbanism Research Hub.1 Routray's book is an epitome of scholarly work that enriches our understanding of the multiple forms, relations and spatial politics of grassroots political agency in different parts of the globe. In what follows, we offer our collective reflections on the book and Sanjeev, as the author, responds. Using a dialogical format, our respective voices are denoted in what follows as ‘review collective (RC)’ and ‘Sanjeev Routray (SR)’. Review collective (RC): Your book draws on an ethnographic study of three state-recognised settlements and their different levels of entrenchment in the city's political landscape. There is a rich discussion of the complex negotiations undertaken by the residents to be visible and assert their numerical strength. Your choice of research sites—a jhuggi jhopri (hutments) settlement, a transit camp and a resettlement colony—provides a nuanced understanding of the varying processes that shape the built environment in Delhi. The diverse research sites offer the opportunity to explore some of the similarities and differences among the various tactics that residents adopt to navigate their precarious living conditions and engage with state authorities. Your long engagement with the residents in your research sites and other urban poor networks in India comes alive through your writing about how caste, class and gender intersect in the urban poor's struggle for citizenship. You identify Muslim women and the oppressed castes as the most vulnerable groups, both facing severe daily struggles and often having restricted means to achieve socio-political mobility. Your descriptive account also shows that, as well as being spaces of discrimination, urban informal settlements can also be emancipatory spaces. Over time, the caste-specific clustering of houses merges with the surrounding settlements, leading to a more heterogeneous community. Additionally, residents adopt a myriad of ways to break caste oppression, such as changing surnames, engaging in identity-based politics and renaming their settlements. It is important to understand better what occurs when residents set aside their caste, class, gender differences and prejudices and come together to demonstrate their numerical solidarity. When do these differences flare up and fragment the community? Sanjeev Routray (SR): The primary objective of my book was to examine how the poor incrementally secure housing and a range of citizenship entitlements in the city. I show how they assert their numerical strength and deploy various tactics and counter-tactics to be visible, identified and counted in their political struggles. So, my first goal was to zero in on social spaces that provided an analytical anchor to examine the processes and temporal dynamics of settlement, displacement and resettlement at different historical conjunctures. As I have argued in the book, the social spaces do not represent stable categories or mental abstractions, as Lefebvre has reminded us in his work (Lefebvre, 1991). Rather, as I show, these spatial settings are suffused with social relations, which both enable and constrain the entrenchment of the poor in extraordinary ways in Delhi. As the state routinely under-enumerates and arbitrarily deems a considerable segment of the poor ineligible for housing and welfare, the primary challenge is to assert numerical strength and presence from a particular cutoff date. To claim welfare entitlements, the residents challenge state enumeration procedures and carry out a multitude of documentary and inscriptive struggles in the city. In all these neighbourhoods, the poor build varied social, economic and political relationships, forge kinship ties, and initiate alliances with politicians, state officials, activists and interlocutors across the social and political spectrum. Their fundamental aim is to systematically build collective solidarity, even if it is fraught, tenuous and often contingent. Despite the above overlaps, there are differences that underpin the tactics of the poor across these spaces. As the primary struggle of jhuggi jhopri residents is to build jhuggis, gain recognition from the local state, claim welfare services, prevent demolition and demand resettlement upon demolition, the poor routinely auto-archive their individual biographies and the life histories of the communities, especially if they intersect with key social and political events in the city, so as to establish authentic presence in the city. Moreover, in the jhuggi jhopri neighbourhood, the residents invoke the memory of their neighbours and kin if state officials reject their proof documents and deem them ineligible for resettlement. While the residents of the transit camp also fight against demolitions and claim basic services, they reclassify and recategorise themselves as ‘regular’ or ‘legal’ by challenging state enunciations and categories, including ‘transitory’, ‘temporary’ and ‘illegal’ through their unique legal tactics to contest their lack of numerical entrenchment in the city. In refining my arguments about collective solidarity, I have emphasised how the poor deploy their demographic calculus as a significant tactic in their claims to housing and citizenship entitlements in general terms. I have emphasised how the tactic of demographic calculus is preeminent in the resettlement neighbourhood as the residents leverage their numerical strength to contest host populations, nominate successful electoral candidates and assert numerical presence in demonstrations. As I have emphasised in the book, the poor do not represent a homogenous category. The collective solidarity marked by bhaichara (brotherhood) and ristedari (relationships) is often disrupted over material and identity-based struggles. For instance, the dalits (oppressed communities at the bottom of the caste hierarchy) of the jhuggi jhopri neighbourhood (oppressed communities at the bottom of the caste hierarchy) often remain alienated from the upper and intermediate-caste leaders and the language of the court due to their low literacy levels. When the court made a distinction between eligible petitioners and ineligible non-petitioners and approved resettlement flats only for the petitioners, a few dalit members expressed their disappointment. They even casually demanded a return of their monetary contributions as a threat. Often the dalit residents (who carried out ‘scavenging’ and recycling work and earned the least) lacked the time and social connections to navigate the labyrinthine bureaucratic structures to demand their entitlements. Similarly, the purchasers of flats/plots in the transit camp and resettlement neighbourhoods often appropriate scarce resources due to their relative economic power and social/political connections if you compare them with the original allottees. Nevertheless, the purchasers also have a precarious existence because the state may reject their sale-purchase affidavits as legitimate documents in offering housing in the city. Thus, at key historical conjunctures, the purchasers share the vulnerabilities of residents who lack legible error-free documents. To give you another example, the intermediaries who mediate between residents, state and different actors are divided along the lines of caste, gender, class, regional origin, and so on. While they engage in significant activities that support the residents, they often foster dependencies and arbitrary exclusions in their so called ‘public dealings’. Moreover, a stark division between male and female chiefs disrupts collective solidarity in the neighbourhood. Male chiefs consistently disparage the work of female chiefs by classifying various activities in gendered terms. They label their own work as contributing to ‘development’ in the neighbourhood, whereas they regard the work of female chiefs as merely contributing to domestic dispute resolutions. At times, the residents also resort to character assassination and rumour-spreading about female intermediaries despite receiving support from them. Most importantly, the passing of the Citizenship Amendment Act in 2019 has exacerbated the divisions between Hindu and Muslim residents. The ensuing protests against the law, riots and police have the Muslim and of as the collective solidarity and the in these that they a of to proof documents and in their to secure housing and citizenship entitlements in the city. the of the in the this book offers timely Your sheds light on the between the the class, different state and In the court the poor on public by residents the of urban or state officials in the informal these that the urban poor are and who have to the of the and have their You engage with these in their with the of urban in in which a from a and technocratic in the to a and in the You also examine the complex surrounding the resettlement the of eligible and ineligible informal and the of the of resettlement In unpacking the complex politics of in you have deployed and a set of and to what extent, has the urban poor's struggle for numerical citizenship or urban and processes in what grassroots and counter-tactics have to successful against a demolition and in what have the collective not To understand urban and I deployed a to the the calculative in the state governmentality over a temporal in Delhi. As the to urban resources if has to by I show how these have up ideas around class city, city and city So, the state at the have and through and and displacement and resettlement of the In that I illustrate how the poor challenge and of to the of I show how the poor assert their numerical strength in their of a community and solidarity. I have how the state enumeration practices are marked by arbitrary of and and state which and experiences of among the practices often to documentary especially and To these the poor around and engage in of on Nevertheless, the numerical citizenship struggles a of counter-tactics of Thus, the poor and and to in their documents. the state agencies in the poor the politics of and the tactics of the state by the of the Right to They carry out to challenge enumeration and by the state the state agencies reject their the poor their with a host of actors to and their claims of authentic presence in the At times, the tactics documents to authentic documents or challenge state Similarly, to contest legal the poor challenge and of and carry out and around and and The urban poor have social because of the of displacement and resettlement. I have how the and of has to demolitions and social in Delhi. Nevertheless, there are of successful I have how the poor and to displacement the the to the transit camp neighbourhood. The poor their numerical state officials and politicians, deployed members and residents, and carried out including and, most importantly, to prevent the demolition of their neighbourhood. In most of the residents in resettlement against demolition in their of Your book a of not only how work on the in the three sites also how shape the of negotiations and … political (Routray, 2022a, p. for in the of their displacement and resettlement in the of Delhi. It is well in the literature that lack legal due to their and a lack of to urban which them to into precarious relations with urban to secure living to their and often in the city, state often from urban services The of has a on their settlements and of in the city. So, at a it is to that there is for these to claim citizenship and entitlements. you that the urban poor's in is a citizenship is over time and As long as the urban can assert their ‘numerical strength and community (Routray, 2022a, p. to themselves as a (Routray, 2022a, p. they can a range of social and entitlements in the city. Your of the numerical citizenship the a within which informal residents are as agents and, are provided with services in for you for a of the collective and political (Routray, 2022a, p. of the urban that agency only through the of a that is to the (Routray, p. that politicians, state and urban often in their for the the book, your of offers a the informal and the of the urban poor in For example, the the and incremental political in means and means shows how temporal and numerical politics intersect to resettlement and citizenship The choice of the reader to the better and the practices of the poor from the in you show the of and and so numerical power is to these of that, be with of While there is the book on the of the urban it does not from within some of the on or the of the you us more about how this concept on and I have to a and to understand urban citizenship in the Global South. In so I the general arguments about the to city’ I remain to the and of urban citizenship the of In this I build on from the frameworks of James and Asef James I the that the poor build to demand citizenship entitlements in the city. I also on his of to understand how the poor build and navigate in the urban the of the poor do not claim citizenship as and in Delhi. The poor are from a resettlement or if they own in Delhi. the poor do not contest relations in they in and with these relations and the in their they do not to a of urban operate with a complex of tactics and Nevertheless, my also (2009) claims that citizenship claims and are homogenous and While I on Asef of how the poor claim housing and in I offer a nuanced understanding of how the poor navigate the in the city. Moreover, in to the of the the of collective solidarity citizenship struggles is in of India. The struggles of the poor do not merely represent and claims of by an extraordinary of and with to understanding how the poor engage in and local practices to navigate the of bureaucratic and political on an I show how the activities of the poor do not merely contest the state, and the of activists and negotiations with a multitude of in the city. In this I examine an of and to understand how power relations, of legal and historical the Most importantly, my arguments on from concept of political work is important as it offers a to understand contextual of and of communities in I as a who has some of the most ideas to challenge the and ideas the of and an ethnographic offers a more nuanced understanding of the of the character of the the dynamics of caste, class, gender relations, the of and the of neighbourhood As a I have his ideas for their in understanding the politics of the For instance, I do not the poor as merely an to the state I show how the poor their claims to be and with and and legal and to secure their entitlements. In a I offer a understanding of urban citizenship in different historical by the complex and labyrinthine of tactics and counter-tactics in Delhi. contextual and these my arguments have in the of the Global South. Your discussion of numerical citizenship how support informal settlements to their to the city through recognition to or at within the city. with the literature how of residents are as the for even the process of right to the city. For example, in how often to a to and fight to their right of ‘numerical is also in between residents and state officials, with enumeration The numerical strength often seen by both and officials as the for visible in the urban environment and citizenship and, a of a dispute in either on The of this numerical residents and community to their and public recognition in the informal settlements. your account that alliances with various across the social are in to claims in these You the of the members of the in and among the informal settlements of Delhi. alliances with local politicians, political and the agency from numerical strength to citizenship and services it has also that the the have become of such the of their the or to for residents the demolition of the camp is such of of local residents in local people in India is seen as the of important that the of informal residents and local social a in them. In this what is your on how the urban poor in navigate the alliances of this complex social to their how have the social in the urban poor's political numerical tactics and in to the struggle for social and the right to the fundamental in this book is to examine the politics of the poor on their own terms. As you can I have my from I remain to social and as they shape the political of the In this I systematically how the activities of the poor intersect with and across the social and political spectrum. The poor in the political and bureaucratic in Delhi. they develop alliances by multiple of and collective They contest the of activists and and their and with a multitude of At times, the poor the at other times, they reject the While the work of the activists is the activities are often at with I have and struggles and how these struggles have to a to claim citizenship entitlements in the city. While there are alliances across in housing and citizenship entitlements, it has on the of the activists as well as the poor to forge a social in Delhi. is because there are differences among in of tactics and political and and of The poor and their on They from legal and across spaces and the poor have it to a social a set of in Delhi. In to we to on The work is the of of ethnographic this your book shows how ethnographic can be to explore the of politics and the of offers a that the of and the to light on both the local and of the struggles for numerical citizenship (Routray, p. your with and experiences with urban poor communities, your account shows the of ethnographic engagement in urban that is a or of has a for and both new and ethnographic in sense, economic and and In this sense, you on how your and ethnographic engagement have the of and the for can you on the you for instance, in different jhuggi jhopri settlements and your as a and as an of the of the I to build to understand the of political practices on the of the poor in the of the Global South. The ethnographic over a temporal has to contest and frameworks about how the poor and with the state in their of housing and other entitlements on an I have deployed a to develop my of numerical citizenship to understand the political agency of the I have to how the poor contest as well as to in the city. In this I show how the poor establish and their political and to gain a in the city. I writing a on the of my research and I some of these arguments to at a in (Routray, ethnographic I show how I built what conditions I built and how these my I light on the of with different members of a heterogeneous community. I also into the of for the and of and the of of the in the As a can you give an of your ongoing there another book in the that the scholarly and there new you are At I writing my book on the of Delhi. Most of the in and also in India from particular in the state of primary objective is to compare and how caste negotiations and community and citizenship struggles among communities of in Delhi. is different from my first Nevertheless, I some of my insights to understand how the their citizenship struggles in a that the deploy various tactics and counter-tactics across space and time to become eligible for citizenship entitlements. the poor communities who own or resettlement in various social most of the houses in the city. they are not to secure documents that establish proof of to welfare in the city. As a they are more in the and political in their They routinely to their to and support for their political leaders These are as they the support of local to claim their citizenship entitlements and welfare In the few I have in other to with the and other of the I for my research a to my our of grassroots and has to a significant of with the and for the that this support the to claim welfare from the are for the time and of the has for us to this and on the has the
The access control (AC) system in an IoT (Internet of Things) context ensures that only authorized entities have access to specific devices and that the authorization procedure is based on pre-established rules. Recently, blockchain-based AC systems have gained attention within research as a potential solution to the single point of failure issue that centralized architectures may bring. Moreover, zero-knowledge proof (ZKP) technology is included in blockchain-based AC systems to address the issue of sensitive data leaking. However, current solutions have two problems: (1) systems built by these works are not adaptive to high-traffic IoT environments because of low transactions per second (TPS) and high latency; (2) these works cannot fully guarantee that all user behaviors are honest. In this work, we propose a blockchain-based AC system with zero-knowledge rollups to address the aforementioned issues. Our proposed system implements zero-knowledge rollups (ZK-rollups) of access control, where different AC authorization requests can be grouped into the same batch to generate a uniform ZKP, which is designed specifically to guarantee that participants can be trusted. In low-traffic environments, sufficient experiments show that the proposed system has the least AC authorization time cost compared to existing works. In high-traffic environments, we further prove that based on the ZK-rollups optimization, the proposed system can reduce the authorization time overhead by 86%. Furthermore, the security analysis is presented to show the system's ability to prevent malicious behaviors.
WebAssembly, or WASM for short, is a binary code format for a stack-based virtual machine, first published in 2018 and now becomes a main-steam technology for providing distributed serverless functions. Recently, the demand for privacy and trustless serverless functions has started to grow in cloud, edge, and grid computation, which poses a question for those serverless function providers: what feature they need to add to make WASM runtime more secure so that the application run on top it become trustless to their users. To address this, we leverage the technology ZKSNARK (zero-knowledge Succinct Non-interactive Argument of Knowledge), a powerful proof system that allows efficient verification of the evaluation problem of statements, to give WASM runtime the ability to provide trustless computation service. More precisely, we present ZAWA, a ZKSNARK backed virtual machine that emulates the execution of WASM bytecode and generates zero-knowledge-proofs for the emulation result. The proof generated by the ZAWA virtual machine can then be used to convince an entity, with no leakage of confidential information, that the result of the emulation enforces the semantic specification of WASM.
With the advent of the era of big data, privacy computing analyzes and calculates data on the premise of protecting data privacy, to achieve data 'available and invisible'. As an important branch of secure multi-party computation, the geometric problem can solve practical problems in the military, national defense, finance, life, and other fields, and has important research significance. In this paper, we study the similarity problem of geometric graphics. First, this paper proposes the adjacency matrix vector coding method of isomorphic graphics, and use the Paillier variant encryption cryptography to solve the problem of isomorphic graphics confidentiality under the semi-honest model. Using cryptography tools such as elliptic curve cryptosystem, zero-knowledge proof, and cut-choose method, this paper designs a graphic similarity security decision protocol that can resist malicious adversary attacks. The analysis shows that the protocol has high computational efficiency and has wide application value in terrain matching, mechanical parts, biomolecules, face recognition, and other fields.
Open access
Biometric Identification and Security
Advanced Steganography and Watermarking Techniques
Arnab Roy, Matthias Johann Steiner, Stefano Trevisani
In this paper we propose the (keyed) permutation Arion and the hash function ArionHash over $\mathbb{F}_p$ for odd and particularly large primes. The design of Arion is based on the newly introduced Generalized Triangular Dynamical System (GTDS), which provides a new algebraic framework for constructing (keyed) permutation using polynomials over a finite field. At round level Arion is the first design which is instantiated using the new GTDS. We provide extensive security analysis of our construction including algebraic cryptanalysis (e.g. interpolation and Gröbner basis attacks) that are particularly decisive in assessing the security of permutations and hash functions over $\mathbb{F}_p$. From an application perspective, ArionHash aims for efficient implementation in zkSNARK protocols and Zero-Knowledge proof systems. For this purpose, we exploit that CCZ-equivalence of graphs can lead to a more efficient implementation of Arithmetization-Oriented primitives. We compare the efficiency of ArionHash in R1CS and Plonk settings with other hash functions such as Poseidon, Anemoi and Griffin. For demonstrating the practical efficiency of ArionHash we implemented it with the zkSNARK libraries libsnark and Dusk Network Plonk. Our result shows that ArionHash is significantly faster than Poseidon - a hash function designed for zero-knowledge proof systems. We also found that an aggressive version of ArionHash is considerably faster than Anemoi and Griffin in a practical zkSNARK setting.
As zero-knowledge proofs gain increasing adoption, the cryptography community has designed domain-specific languages (DSLs) that facilitate the construction of zero-knowledge proofs (ZKPs). Many of these DSLs, such as Circom, facilitate the construction of arithmetic circuits, which are essentially polynomial equations over a finite field. In particular, given a program in a zero-knowledge proof DSL, the compiler automatically produces the corresponding arithmetic circuit. However, a common and serious problem is that the generated circuit may be underconstrained, either due to a bug in the program or a bug in the compiler itself. Underconstrained circuits admit multiple witnesses for a given input, so a malicious party can generate bogus witnesses, thereby causing the verifier to accept a proof that it should not. Because of the increasing prevalence of such arithmetic circuits in blockchain applications, several million dollars worth of cryptocurrency have been stolen due to underconstrained arithmetic circuits. Motivated by this problem, we propose a new technique for finding ZKP bugs caused by underconstrained polynomial equations over finite fields. Our method performs semantic reasoning over the finite field equations generated by the compiler to prove whether or not each signal is uniquely determined by the input. Our proposed approach combines SMT solving with lightweight uniqueness inference to effectively reason about underconstrained circuits. We have implemented our proposed approach in a tool called QED 2 and evaluate it on 163 Circom circuits. Our evaluation shows that QED 2 can successfully solve 70% of these benchmarks, meaning that it either verifies the uniqueness of the output signals or finds a pair of witnesses that demonstrate non-uniqueness of the circuit. Furthermore, QED 2 has found 8 previously unknown vulnerabilities in widely-used circuits.
César Sabater, Florian Hahn, Peter Andreas, Jan Ramon
In this paper we study verifiable sampling from probability distributions in the context of multi-party computation. This has various applications in randomized algorithms performed collaboratively by parties not trusting each other. One example is differentially private machine learning where noise should be drawn, typically from a Laplace or Gaussian distribution, and it is desirable that no party can bias this process. In particular, we propose algorithms to draw random numbers from uniform, Laplace, Gaussian and arbitrary probability distributions, and to verify honest execution of the protocols through zero-knowledge proofs. We propose protocols that result in one party knowing the drawn number and protocols that deliver the drawn random number as a shared secret.