OT Protocol Research Articles

Computationally Secure Semi‐Quantum All‐Or‐Nothing Oblivious Transfer from Dihedral Coset States

AbstractThe quest for perfect quantum oblivious transfer (QOT) with information‐theoretic security remains a challenge, necessitating the exploration of computationally secure QOT as a viable alternative. Unlike the unconditionally secure quantum key distribution (QKD), the computationally secure QOT relies on specific quantum‐safe computational hardness assumptions, such as the post‐quantum hardness of learning with errors (LWE) problem and quantum‐hard one‐way functions. This raises an intriguing question: Are there additional efficient quantum hardness assumptions that are suitable for QOT? In this work, leveraging the dihedral coset state derived from the dihedral coset problem (DCP), a basic variant of OT, known as the all‐or‐nothing OT, is studied in the semi‐quantum setting. Specifically, the DCP originates from the dihedral hidden subgroup problem (DHSP), conjectured to be challenging for any quantum polynomial‐time algorithms. First, a computationally secure quantum protocol is presented for all‐or‐nothing OT, which is then simplified into a semi‐quantum OT protocol with minimal quantumness, where the interaction needs merely classical communication. To efficiently instantiate the dihedral coset state, a powerful cryptographic tool called the LWE‐based noisy trapdoor claw‐free functions (NTCFs) is used. The construction requires only a three‐message interaction and ensures perfect statistical privacy for the receiver and computational privacy for the sender.

Simple Two-Message OT in the Explicit Isogeny Model

In this work we study algebraic and generic models for group actions, and extend them to the universal composability (UC) framework of Canetti (FOCS 2001). We revisit the constructions of Duman et al. (PKC 2023) integrating the type-safe model by Zhandry (Crypto 2022), adapted to the group action setting, and formally define an algebraic action model (AAM). This model restricts the power of the adversary in a similar fashion to the algebraic group model (AGM). By imposing algebraic behaviour to the adversary and environment of the UC framework, we construct the UC-AAM. Finally, we instantiate UC-AAM with isogeny-based assumptions, in particular the CSIDH action with twists, obtaining the explicit isogeny model, UC-EI; we observe that, under certain assumptions, this model is "closer" to standard UC than the UC-AGM, even though there still exists an important separation. We demonstrate the utility of our definitions by proving UC-EI security for the passive-secure oblivious transfer protocol described by Lai et al. (Eurocrypt 2021), hence providing the first concretely efficient two-message isogeny-based OT protocol in the random oracle model against malicious adversaries.

Preoperative OT Evaluations of Left Ventricular Assist Device Candidates: Outcomes & Impact on Practice

Abstract Date Presented 04/22/2023 Purpose: Describe feasibility and clinical value of preoperative OT evaluations for left ventricular assist device (LVAD) candidates. Design & Method: Single-center observational; descriptive analyses of 139 candidates’ OT evaluations. Results: Cognition, frailty, activities of daily living, and LVAD care measures led OT to predict that 36% would need no assist, 39% some assist, and 24% 24/7 supervision to manage LVADs. Conclusion: The OT protocol gave insight into candidates’ LVAD self-care needs and was feasible. Impact: Supports OT preoperative LVAD consults as standard of care. Primary Author and Speaker: Jessica Asiello Additional Authors and Speakers: Christina M. Kelley Contributing Authors: John Wong, Marissa Dittrich, Abigail Begin, Kimberly Beatty, Erin Donovan, Kellie Cannone, Miranda Mlincek, Zeina Fayad

UC Secure Private Branching Program and Decision Tree Evaluation

Branching program (BP) is a DAG-based non-uniform computational model for L&#x002F;poly class. It has been widely used in formal verification, logic synthesis, and data analysis. As a special BP, a decision tree is a popular machine learning classifier for its effectiveness and simplicity. In this work, we propose a UC-secure efficient 3-party computation platform for outsourced branching program and&#x002F;or decision tree evaluation. We construct a constant-round protocol and a linear-round protocol. In particular, the overall (online &#x002B; offline) communication cost of our linear-round protocol is <inline-formula><tex-math notation="LaTeX">$O( {d( {\ell + log m + log n} )} )$</tex-math></inline-formula> and its round complexity is 2<i>d</i>-1, where <i>m</i> is the DAG size, n is the number of features, <inline-formula><tex-math notation="LaTeX">$\ell $</tex-math></inline-formula> is the feature length, and <i>d</i> is the longest path length. To enable efficient oblivious hopping among the DAG nodes, we propose a lightweight 1-out-of-<i>N</i> shared OT protocol with logarithmic communication in both online and offline phase. This partial result may be of independent interest to some other cryptographic protocols. Our benchmark shows, compared with the state-of-the-arts, the proposed constant-round protocol is up to 10X faster in the WAN setting, while the proposed linear-round protocol is up to 15X faster in the LAN setting.

Machine Learning Algorithms for Identifying Dependencies in OT Protocols

This study illustrates the utility and effectiveness of machine learning algorithms in identifying dependencies in data transmitted in industrial networks. The analysis was performed for two different algorithms. The study was carried out for the XGBoost (Extreme Gradient Boosting) algorithm based on a set of decision tree model classifiers, and the second algorithm tested was the EBM (Explainable Boosting Machines), which belongs to the class of Generalized Additive Models (GAM). Tests were conducted for several test scenarios. Simulated data from static equations were used, as were data from a simulator described by dynamic differential equations, and the final one used data from an actual physical laboratory bench connected via Modbus TCP/IP. Experimental results of both techniques are presented, thus demonstrating the effectiveness of the algorithms. The results show the strength of the algorithms studied, especially against static data. For dynamic data, the results are worse, but still at a level that allows using the researched methods to identify dependencies. The algorithms presented in this paper were used as a passive protection layer of a commercial IDS (Intrusion Detection System).

A location-based privacy-preserving oblivious sharing scheme for indoor navigation

In recent years, with the rapid development of wireless communication technology and mobile devices, etc., indoor localization and navigation using WiFi sensing are increasingly being widely employed in life. On this basis, various applications of location-based services have been rapidly developed. However, when users enjoy the location query service of LBS providers, there is a risk of exposing personal information and location privacy simultaneously. In particular, the sensitive information about users based on their location privacy can be inferred by malicious users. Therefore, how to implement location hiding, query privacy protection and query result feedback at the same time is one of the crucial issues of LBS privacy protection. A novel oblivious data sharing scheme employing the designed 1-out-of-n oblivious transfer protocol is proposed to achieve an efficient location-based service for users while effectively hiding location coordinates and protecting the privacy of users and servers. In addition, once a user accesses the same keyword several times, the server is bound to be able to master the accessed frequency of keywords. For this reason, the string length-based transformation algorithm based on private information retrieval is designed and added as a part of OT protocol, which effectively reduces the communication overhead and ensures the privacy of required keywords. The security and performance analysis indicate that the proposed protocol can be instantiated in indoor navigation with high security and efficiency.

Anomaly Detection in Cyclic Communication in OT Protocols

This paper demonstrates the effectiveness of using anomaly detection in cyclic communication as a method aimed at protecting industrial installations from steganographic communication and a wide range of cyberattacks. The analysis was performed for a method based on deterministic finite automaton and the authors’ method using cycles. In this paper, we discuss the cycle detection algorithm and graph construction as well as demonstrate an anomaly detection method for cyberattack detection that utilizes stochastic elements, such as time-to-response and time-between-messages. We present a novel algorithm that combines finite automaton determinism modeling consecutive admissible messages with a time-domain model allowing for random deviations of regularity. The study was conducted for several test scenarios, including C&amp;C steganographic channels generated using the Modbus TCP/IP protocol. Experimental results demonstrating the effectiveness of the algorithms are presented for both methods. All algorithms described in this paper are implemented and run as part of a passive warden system embedded in a bigger commercial IDS (intrusion detection system).

Specification and space complexity of collaborative text editing

Collaborative text editing systems allow users to concurrently edit a shared document, inserting and deleting elements (e.g., characters or lines). There are a number of protocols for collaborative text editing, but so far there has been no abstract, high-level specification of their desired behavior, which is decoupled from their actual implementation. Several of these protocols have been shown not to satisfy even basic expectations. This paper provides a precise specification of a replicated abstract list object, which models the core functionality of replicated systems for collaborative text editing. We define a strong list specification, which we prove is implemented by an existing protocol, as well as a weak list specification, which admits additional protocol behaviors.A major factor determining the efficiency and practical feasibility of a collaborative text editing protocol is the space overhead of the metadata that the protocol must maintain to ensure correctness. We show that for a large class of list protocols, implementing either the strong or the weak list specification requires a metadata overhead that is at least linear in the number of elements deleted from the list. The class of protocols to which this lower bound applies includes all list protocols that we are aware of, in particular CRDT and OT protocols, and we show that one of these protocols almost matches the bound. The result holds for peer-to-peer protocols, even if the network guarantees causal atomic broadcast. The result also holds for the metadata cost at the clients in client/server protocols.1

Efficient blind face recognition in the cloud

Nowadays, with the maturity and wide application of face recognition technology, the recognition accuracy, recognition efficiency, and data security have attracted people’s attention. However, when face recognition is performed, face information is completely exposed to the cloud server without any protection measures. Therefore, a series of problems caused by insecure face information is coming. Can we find a way to prevent uncontrolled use of facial information without cloud protection and improve recognition efficiency and accuracy? Given this situation, we have proposed two options. The first requires a third-party library; the second does not require a third-party library. The first scheme is efficient privacy preserving face identification in the cloud through sparse representation, which relies on the third-party face image database, and the first scheme is simply referred to as SRBased. The second scheme is efficient privacy preserving face identification in the cloud based on deep neural network, which does not depend on the third-party face image database, and the second scheme is simply referred to as DNNBased. Both schemes can be divided into two parts: client and cloud server. The client is responsible for acquiring face images, and the server is responsible for recognizing and calculating. Through homomorphic encryption and OT protocol, secure face recognition is realized. In the whole recognition process, the server does not need to decrypt the image data. In the two schemes, the client and the server will not get any information from each other. Even if the third party intercepts the ciphertext in the transmission process, it will not get any information under the premise of private key security. Therefore, the two schemes can achieve the purpose of protecting privacy and security. The experimental results show that the efficiency of the two schemes is greatly improved compared with SCiFI schemes. The second scheme improves recognition accuracy greatly.

Cut-and-choose bilateral oblivious transfer protocol based on DDH assumption

In secure two-party computation protocols, the cut-and-choose paradigm is used to prevent the malicious party who constructs the garbled circuits from cheating. In previous realization of the cut-and-choose technique on the garbled circuits, the delivery of the random keys is divided into multiple stages. Thus, the round complexity is high and the consistency of cut-and-choose challenge should be proved. Based on DDH assumption, we build a so-called cut-and-choose bilateral oblivious transfer protocol, which transfers all necessary keys of garbled circuits in one process. Specifically, in our oblivious transfer protocol, the sender inputs two pairs $$(k_0^1,k_1^1)$$ , $$(k_0^2,k_1^2)$$ and a bit $$\tau$$ ; the receiver inputs two bits $$\sigma$$ and j. After the protocol execution, the receiver obtains $$k_{\tau }^1,k_{\sigma }^2$$ for $$j=1$$ , and $$k_0^1,k_1^1,k_0^2,k_1^2$$ for $$j=0$$ . The protocol inherit the cut-and-choose OT protocol in Lindell and Pinkas (Proceedings of the 8th conference on theory of cryptography, Springer, 2011), and can be applied into the state-of-the-art cut-and-choose secure two party computation protocol without any obstacles. By the cut-and-choose bilateral oblivious transfer protocol, the cut-and-choose challenge j is no need to be opened anymore, therefore the consistency proof of j is omitted, and the round complexity of secure two-party computation protocol can be decreased.

Nonfunctional overreaching and hepatic adaptations of APPL1 and APPL2

Abstract AIMS Previously, we verified that overtrained mice upregulated the TRB3 levels, its association with Akt, and the hepatic concentrations of glycogen. It is known that APPL1 can limit the interaction between TRB3 and Akt, playing an important role in the glucose homeostasis. Thus, we verified the effects of three overtraining protocols on the hepatic levels of APPL1 and APPL2. METHODS Rodents were divided into control (CT), overtrained by downhill running (OTR/down), overtrained by uphill running (OTR/up) and overtrained by running without inclination (OTR). The hepatic contents of APPL1 and APPl2 were measured by the immunoblotting technique. RESULTS Significant elevation of APPL1 observed in the OTR/down and OTR/up groups, as well as the tendency of increase (p=0.071) observed in the OTR group. CONCLUSION These results indicate that this particular protein is likely to participate in the glucose homeostasis previously observed in response to these OT protocols.

Generic Fully Simulatable Adaptive Oblivious Transfer

We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, and DCR. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. The constructions follow a novel designing approach called “blind permutation”, which completely differs from existing ones. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure OT protocols, with a loss in efficiency.

Quantum Oblivious Transfer Based on a Quantum Symmetrically Private Information Retrieval Protocol

Private information retrieval implies oblivious transfer in classical cryptography. Following this clue, we present a novel quantum one-out-of-two OT protocol based on a practical quantum symmetrically private information retrieval protocol Jakobi et al. (Phys. Rev. A 83, 022301 2011), with changes only in the classical postprocessing of the key. While unconditionally secure oblivious transfer is known to be impossible, we argue that an interesting degree of security can be achieved by means of quantum physical principles instead of unproven security assumptions in order to protect both the sender and the receiver. The proposed OT protocol is loss tolerant, practical and robust against quantum memory attack.

Proteomic profiling of skeletal muscle in an animal model of overtraining

Excessive training (i.e. overtraining, OT) may result in underperformance, which can be characterized by the time needed to re-establish performance (i.e. functional overreaching (FOR), nonfunctional overreaching, OT syndrome). The present study is an initial screening for proteins presenting altered abundance in the red (RG) and white (WG) portions of the gastrocnemius muscle from rats submitted to an OT protocol that induced FOR. In the RG, compared to the nontrained control, FOR demonstrated an increased abundance of proteins normally related to adaptation to endurance training (e.g. proteins of oxidative phosphorylation complexes, proteins related to lipid metabolism, antioxidants, and chaperones). In the WG, spots identified as mitochondrial aconitase and a component of the succinate dehydrogenase complex were downregulated in FOR, as were proteins related to myofibril stabilization; these latter were upregulated in the RG. This initial study shows that skeletal muscles with different fiber-type compositions respond differently to an OT period. Also, it is likely that actin-interacting proteins have an important role in muscle adaptation to endurance exercise.

Electronic voting scheme based on OT protocol

OT_n~k protocol well satisfies the requirements of anonymity and multi-selection in election.This paper applied OT protocol to electronic voting and presented a new electronic voting scheme,which made it available to have such a voting with the characteristic of multi-selection.Meanwhile,the scheme has its basic characteristic of safe electronic voting scheme with efficiency,which can be used in large-scale election,thus improving and consummating the electronic voting scheme.Also,the electronic voting scheme broadens the application of OT protocol and plays an active part in promoting a further study on OT protocol.

A soft technology to improve survival and reproductive performance of Litopenaeus stylirostris by counterbalancing physiological disturbances associated with handling stress

The consequences of handling stress (fishing, transfer, eyestalk ablation) on shrimp broodstock are poorly documented. The weakness of farmed shrimp, Litopenaeus stylirostris, during winter is a major problem in New Caledonia, because of seasonal climate (tropical–sub-temperate). The transfer of broodstock in winter from earthen outdoor ponds to indoor maturation tanks in the hatchery ( T = 20 °C, Salinity = 35‰, fed shrimp) usually leads, after 48 h, to high mortality (up to 70%). Eyestalk ablation to induce ovarian maturation in females leads to further mortality. Starting from a background analysis of physiological disturbances (initial osmoregulatory imbalance) associated with handling stress (Wabete, N., Chim, L., Lemaire, P., Massabuau, J.-C., 2004. Caractérisation de problèmes de physiologie respiratoire et d'échanges ioniques associés à la manipulation chez la crevette pénéide Litopenaeus stylirostris à 20 °C. Styli 2003. Trente ans de crevetticulture en Nouvelle-Calédonie. Ed. Ifremer. Actes Colloq. 38, 75-84.), we developed a protocol using a soft technology, based on modifications of water salinity, temperature and feeding regime. The aim was to minimize problems of osmoregulatory imbalance and associated mortalities. The protocol we developed, called the LSD OT protocol (Low Salinity and Diet, Optimal Temperature), was first evaluated on sub-adult shrimp (20–25 g) and then applied to broodstock. Survival after transfer and following eyestalk ablation, as well as reproductive achievement (spawning rate, nauplii number) was considerably improved when shrimps were transferred under “physiological comfort” i.e. warmed isosmotic water (26 °C and 26‰) and unfed for 3 d. This new handling protocol, based on a better control of salinity, temperature and feeding conditions, has been transferred successfully to private hatcheries and already contributes to an increased profitability of New-Caledonian shrimp industry.

Oblivious polynomial evaluation

The problem of two-party oblivious polynomial evaluation (OPE) is studied, where one party (Alice) has a polynomial P(x) and the other party (Bob) with an input x wants to learn P(x) in such an oblivious way that Bob obtains P(x) without learning any additional information about P except what is implied by P(x) and Alice does not know Bob's input x. The former OPE protocols are based on an intractability assumption except for OT protocols. In fact, evaluating P(x) is equivalent to computing the product of the coefficient vectors (a 0 ,..., a n ) and (1,..., xn). Using this idea, an efficient scale product protocol of two vectors is proposed first and then two OPE protocols are presented which do not need any other cryptographic assumption except for OT protocol. Compared with the existing OPE protocol, another characteristic of the proposed protocols is the degree of the polynomial is private. Another OPE protocol works in case of existence of untrusted third party.

공평한 비밀정보 교환

A fair exchange protocol enable two parties to exchange secrets with fairness, so that neither can gain any information advantage by quitting prematurely or otherwise misbehaving. Therefore a fair exchange is the most important for electronic transactions between untrusted parties. To design new fair exchange, after describing basic concepts, definitions and existing protocols and designing a non-interactive OT protocol using ELGamal`s public key system, I will design new protocol to support fair exchange. In my designed new protocol, untrusted parties exchange secrets obliviously and verify that their received secrets are true by using transformed Zero Knowledge Interactive Proof extended to duplex. At this time, concerned two parties can`t decrypt the other`s ciphertext. .After all of the steps, two parties can do it. It is the most important to provide perfect fairness and anonymity to untrusted parties in this protocol.

Self-monitored exercise at three different RPE intensities in treadmill vs field running

The aims of the present study were a) to compare the outcome of running exercise performed on a treadmill (laboratory) and an outdoor track (field) using an RPE production protocol and b) to study this kind of protocol used over time (3-5 wk). A group of 11 healthy male subjects participated, with ages varying from 33 to 65 yr (mean = 42.9 +/- 11.0 yr). Two test sessions consisting of both treadmill and track exercise were performed in a rotated order to control for sequential effects. All subjects exercised according to an identical protocol: two successive trials (3 min each) at RPE 11 (light exertion), followed by a RPE 13 (somewhat hard) trial (11 min) and, finally, a RPE 15 (hard) trial (5 min). Results show significantly different levels of heart rate (HR), blood lactate, and velocity at the three RPE levels. Large differences were also observed in all measured variables between field and laboratory. These differences were consistent over time. A high internal consistency, measured by test-retest reliability (alpha greater than 0.9), was obtained for both velocity and HR between the first two trials at RPE 11. In conclusion, the RPE method functioned well as a means of monitoring and regulating exercise intensity.