aqora

Secure Computation from Leaky Correlated Randomness

Divya Gupta, Yuval Ishai, Hemanta K. Maji +1 more

Lecture notes in computer scienceJan 1, 20157 citations

On Lower Bounds and Size Reduction for Correlated Randomness in Secure Two-party Computation

Keitaro Hiwatashi

Mar 21, 20240 citations

On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness

Bar Alon, Olga V. Nissenbaum, Eran Omri +2 more

Lecture notes in computer scienceJan 1, 20220 citations

Group Structure in Correlations and Its Applications in Cryptography

Guru-Vamsi Policharla, Manoj Prabhakaran, Rajeev Raghunath +1 more

Correlated random variables are a key tool in cryptographic applications like secure multi-party computation. We investigate the power of a class of correlations that we term group correlations: A group correlation is a uniform distribution over pairs (x,y) ∈ G² such that x+y ∈ S, where G is a (possibly non-abelian) group and S is a subset of G. We also introduce bi-affine correlation{s}, and show how they relate to group correlations. We present several structural results, new protocols and applications of these correlations. The new applications include a completeness result for black box group computation, perfectly secure protocols for evaluating a broad class of black box "mixed-groups" circuits with bi-affine homomorphisms, and new information-theoretic results. Finally, we uncover a striking structure underlying OLE: In particular, we show that OLE over 𝔽_{2ⁿ}, is isomorphic to a group correlation over ℤ_4^n.Correlated random variables are a key tool in cryptographic applications like secure multi-party computation. We investigate the power of a class of correlations that we term group correlations: A group correlation is a uniform distribution over pairs (x,y) ∈ G² such that x+y ∈ S, where G is a (possibly non-abelian) group and S is a subset of G. We also introduce bi-affine correlation{s}, and show how they relate to group correlations. We present several structural results, new protocols and applications of these correlations. The new applications include a completeness result for black box group computation, perfectly secure protocols for evaluating a broad class of black box "mixed-groups" circuits with bi-affine homomorphisms, and new information-theoretic results. Finally, we uncover a striking structure underlying OLE: In particular, we show that OLE over 𝔽_{2ⁿ}, is isomorphic to a group correlation over ℤ_4^n.

Leibniz international proceedings in informaticsJan 1, 20210 citations

Quantum Key Distribution Using Hadamard & CNOT Gates with Reduced Bit Consumption

N.J.Dev Nikeathan, Kalavathi Palanisamy

In Cryptography, the Key Distribution methods is a secure way to transmit the keys.To transmit the key,the usage of the bits is high in Classical computers, where as in Quantum Computing it take fewer qubits than classical computers. In this work, we introduce a QKD (Quantum key Distribution) method that combines the Hadamard (H) gate and the Controlled-NOT (CNOT) gate to increase randomness and attack detector. The Hadamard gate creates superposition qubits, giving random outcomes that cannot be predicted unless the measurement is made. The CNOT gate uses entanglement in qubit pairs, so if anyone attempts to intercept or disturb one qubit, it can be detected immediately. Compared to classical key exchange, which often needs many bits and strong computational power this quantum approach generates secure keys using fewer bits because superposition and entanglement naturally provide randomness and correlation. Simulations of the proposed circuit show stronger security and faster key generation, making this method suitable for future lightweight and highly secure communication systems.In Cryptography, the Key Distribution methods is a secure way to transmit the keys.To transmit the key,the usage of the bits is high in Classical computers, where as in Quantum Computing it take fewer qubits than classical computers. In this work, we introduce a QKD (Quantum key Distribution) method that combines the Hadamard (H) gate and the Controlled-NOT (CNOT) gate to increase randomness and attack detector. The Hadamard gate creates superposition qubits, giving random outcomes that cannot be predicted unless the measurement is made. The CNOT gate uses entanglement in qubit pairs, so if anyone attempts to intercept or disturb one qubit, it can be detected immediately. Compared to classical key exchange, which often needs many bits and strong computational power this quantum approach generates secure keys using fewer bits because superposition and entanglement naturally provide randomness and correlation. Simulations of the proposed circuit show stronger security and faster key generation, making this method suitable for future lightweight and highly secure communication systems.

International Journal of Innovative Research in Advanced EngineeringDec 11, 20250 citations

Correlated Pseudorandomness in Secure Computation

Geoffroy Couteau

Mar 20, 20240 citations

On the Power of Correlated Randomness in Secure Computation

Related papers

On the Power of Correlated Randomness in Secure Computation

Related papers