Zero-knowledge range proofs and applications on decentralized constructions

Günsay, Esra
Appropriate, effective, and efficient use of cryptographic protocols contributes to many novel advances in real-world privacy-preserving constructions. One of the most important cryptographic protocols is the zero-knowledge proofs. The zero-knowledge proofs have recently gained the utmost importance in terms of decentralized systems, especially in the context of privacy. In many decentralized systems, such as electronic voting, e-cash, e-auctions, or anonymous credentials, the zero-knowledge range proofs are used as the building blocks. In this thesis, we examine, summarise and compare range proofs based on zero-knowledge proofs, and examine their applications in decentralized systems such as distributed ledgers, confidential assets and smart contracts. We also, investigate different basis of OR-proofs and compare the efficiency of different basis approaches. To this end, we have modified the Mao’s range proof [31] to base-3 with a modified OR-proof [16]. For each basis, we derive the number of computations in modulo exponentiations and the cost of numbers exchanged between parties. Then, we have generalized these costs for base-u construction. At the end of these comparisons, we observe that comparing the number of computations in modulo exponentiations with other base approaches, the base-3 approach is 5.5% more efficient. In addition, comparing the cost of numbers exchanged between prover and verifier, base-3 approach is 7% more efficient than other base approaches.


Parallel decodable channel coding implemented on a MIMO testbed
Aktaş, Tuğcan; Yılmaz, Ali Özgür; Department of Electrical and Electronics Engineering (2007)
This thesis considers the real-time implementation phases of a multiple-input multiple-output (MIMO) wireless communication system. The parts which are related to the implementation detail the blocks realized on a field programmable gate array (FPGA) board and define the connections between these blocks and typical radio frequency front-end modules assisting the wireless communication. Two sides of the implemented communication testbed are discussed separately as the transmitter and the receiver parts. In a...
Experiences in the practical application of Computational Aeroacousties
Morris, Philip J.; Long, Lyle N.; Bangalore, Ashok; Chyczewski, Thomas; Lockard, David P.; Özyörük, Yusuf (1996-12-01)
This paper describes some of the issues that must be addressed in the use of Computational Aeroacoustics (CAA) for the solution of problems of practical importance. Solutions to some of these difficulties are also given. Previous studies have only emphasized the development of algorithms and their application to relatively simple model problems. The particular issues addressed in this paper include: the computational resources required for CAA calculations; grid selection; boundary treatments; equation and ...
TMVP-Friendly Primes for Efficient Elliptic Curve Cryptography
Taskin, Halil Kemal; Cenk, Murat (2020-12-03)
The need for faster and practical cryptography is a research topic for decades. In case of elliptic curve cryptography, which was proposed by Koblitz and Miller in 1985 as a more efficient alternative to RSA, the applications in real life started after 2000s. Today, most of the popular applications and protocols like Whatsapp, Signal, iOS, Android, TLS, SSH, Bitcoin etc. make use of Elliptic curve cryptography. One of the important factor for high performance elliptic curve cryptography is the finite field ...
Nonblocking hierarchical control of decentralized des
Schmidt, Klaus Verner; Moor, Thomas (null; 2005-12-01)
This work considers a hierarchical control architecture for a class of discrete event systems which can also be applied to decentralized control systems. It is shown that nonblocking supervisory control on the high level of the hierarchy results in nonblocking and hierarchically consistent control on the low level. Copyright © 2005 IFAC.
Maximally Permissive Hierarchical Control of Decentralized Discrete Event Systems
SCHMİDT, KLAUS WERNER; Schmidt, Klaus Verner (2011-04-01)
The subject of this paper is the synthesis of natural projections that serve as nonblocking and maximally permissive abstractions for the hierarchical and decentralized control of large-scale discrete event systems. To this end, existing concepts for nonblocking abstractions such as natural observers and marked string accepting (msa)-observers are extended by local control consistency (LCC) as a novel sufficient condition for maximal permissiveness. Furthermore, it is shown that, similar to the natural obse...
Citation Formats
E. Günsay, “Zero-knowledge range proofs and applications on decentralized constructions,” M.S. - Master of Science, Middle East Technical University, 2021.