scholarly journals Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 1001
Author(s):  
Bruno Costa ◽  
Pedro Branco ◽  
Manuel Goulão ◽  
Mariano Lemus ◽  
Paulo Mateus
Keyword(s):  
Building Block ◽  
Large Scale ◽  
String Model ◽  
Oblivious Transfer ◽  
Secure Computation ◽  
Multiparty Computation ◽  
Basic Building Block ◽  
Universal Composability ◽  
Common Reference ◽  
Common Reference String

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.

Secure Multiparty Computation

2018 ◽  
pp. 154-166
Author(s):  
Kannan Balasubramanian ◽  
M. Rajakani
Keyword(s):  
Data Mining ◽  
Public Key Infrastructure ◽  
Secure Multiparty Computation ◽  
Public Key ◽  
Multiparty Computation ◽  
Scientific Computation ◽  
Database Querying ◽  
Common Reference ◽  
Different Types ◽  
Common Reference String

The Secure Multiparty computation is characterized by computation by a set of multiple parties each participating using the private input they have. There are different types of models for Secure Multiparty computation based on assumption about the type of adversaries each model is assumed to protect against including Malicious and Covert Adversaries. The model may also assume a trusted setup with either using a Public Key Infrastructure or a using a Common Reference String. Secure Multiparty Computation has a number of applications including Scientific Computation, Database Querying and Data Mining.

scholarly journals A note on universal composable zero-knowledge in the common reference string model

2009 ◽  
Vol 410 (11) ◽  
pp. 1099-1108 ◽  
Author(s):  
Andrew C.C. Yao ◽  
Frances F. Yao ◽  
Yunlei Zhao
Keyword(s):  
String Model ◽  
Zero Knowledge ◽  
Common Reference ◽  
The Common ◽  
Common Reference String

scholarly journals Zero-Knowledge Proofs and String Commitments Withstanding Quantum Attacks

2004 ◽  
Vol 11 (9) ◽  
Author(s):  
Ivan B. Damgård ◽  
Serge Fehr ◽  
Louis Salvail
Keyword(s):  
String Model ◽  
Zero Knowledge ◽  
New Techniques ◽  
Common Reference ◽  
Commitment Schemes ◽  
Quantum Protocols ◽  
Hard Problems ◽  
The Common ◽  
Common Reference String ◽  
General Method

The concept of zero-knowledge (ZK) has become of fundamental importance in cryptography. However, in a setting where entities are modeled by quantum computers, classical arguments for proving ZK fail to hold since, in the quantum setting, the concept of rewinding is not generally applicable. Moreover, known classical techniques that avoid rewinding have various shortcomings in the quantum setting.<br /> <br />We propose new techniques for building <em>quantum</em> zero-knowledge (QZK) protocols, which remain secure even under (active) quantum attacks. We obtain computational QZK proofs and perfect QZK arguments for any NP language in the common reference string model. This is based on a general method converting an important class of classical honest-verifier ZK (HVZK) proofs into QZK proofs. This leads to quite practical protocols if the underlying HVZK proof is efficient. These are the first proof protocols enjoying these properties, in particular the first to achieve perfect QZK.<br /> <br />As part of our construction, we propose a general framework for building unconditionally hiding (trapdoor) string commitment schemes, secure against quantum attacks, as well as concrete instantiations based on specific (believed to be) hard problems. This is of independent interest, as these are the first unconditionally hiding string commitment schemes withstanding quantum attacks.<br /> <br />Finally, we give a partial answer to the question whether QZK is possible in the plain model. We propose a new notion of QZK, <em>non-oblivious verifier</em> QZK, which is strictly stronger than honest-verifier QZK but weaker than full QZK, and we show that this notion can be achieved by means of efficient (quantum) protocols.

scholarly journals The Future of the Basic Building Block of Telecommunications Network

2020 ◽  
Author(s):  
Ibraheem Kateeb ◽  
Larry Burton ◽  
Naser El-Bathy ◽  
Michael Peluso
Keyword(s):  
Building Block ◽  
Basic Building Block ◽  
The Future ◽  
Telecommunications Network

Implementation of types of VCO

2021 ◽  
Vol 9 (8) ◽  
pp. 2972-2678
Author(s):  
Akshata O. Kattimani
Keyword(s):  
Frequency Shift ◽  
Building Block ◽  
Relaxation Oscillator ◽  
Phase Locked Loop ◽  
Frequency Synthesizers ◽  
Ring Oscillator ◽  
Electronic Systems ◽  
Basic Building Block ◽  
Colpitts Oscillator ◽  
Shift Keying

Abstract: A Voltage Controlled Divider (VCO) is a basic building block in most of the electronic systems. Phase-locked loop (PLL), tone synthesizers, Frequency Shift Keying (FSK), frequency synthesizers, etc make use of VCO’s to generate an oscillating frequency that can be decided with the help of components. Voltage Controlled Divider can be implemented for analog applications. The project proposes three types of VCO using Electric tool and LT Spice XVII tool. The three VCO’s that are implemented are CMOS Ring Oscillator, Colpitts Oscillator and Relaxation Oscillator. These circuits generate two oscillating frequencies that is decided by the circult components. Keywords: Voltage Controlled Divider (VCO), CMOS Ring Oscillator, Colpitts Oscillator, Relaxation Oscillator, oscillating frequency.

Sign in / Sign up

Export Citation Format

Share Document