English
Related papers

Related papers: Revisiting Definitional Foundations of Oblivious R…

200 papers

Observation Resilient Authentication Schemes (ORAS) are a class of shared secret challenge-response identification schemes where a user mentally computes the response via a cognitive function to authenticate herself such that eavesdroppers…

Cryptography and Security · Computer Science 2020-07-23 Benjamin Zi Hao Zhao , Hassan Jameel Asghar , Mohamed Ali Kaafar , Francesca Trevisan , Haiyue Yuan

Vulnerabilities emanating from DRAM errors pose a vexing problem that remains, as of yet, unsolved and elusive but cannot be ignored. Prior defenses focused on specific details of early RowHammer attacks and fail to generalize with the…

Cryptography and Security · Computer Science 2026-03-12 Manuel Wiesinger , Daniel Dorfmeister , Stefan Brunthaler

We put forth Oblivious State Preparation (OSP) as a cryptographic primitive that unifies techniques developed in the context of a quantum server interacting with a classical client. OSP allows a classical polynomial-time sender to input a…

Quantum Physics · Physics 2024-11-08 James Bartusek , Dakshita Khurana

Rowhammer is a hardware vulnerability in DRAM memory, where repeated access to memory can induce bit flips in neighboring memory locations. Being a hardware vulnerability, rowhammer bypasses all of the system memory protection, allowing…

Cryptography and Security · Computer Science 2020-07-30 Zhi Zhang , Yueqiang Cheng , Dongxi Liu , Surya Nepal , Zhi Wang , Yuval Yarom

Although Retrieval-Augmented Generation (RAG) systems have been widely applied, the privacy and security risks they face, such as data leakage and data poisoning, have not been systematically addressed yet. Existing defense strategies…

Cryptography and Security · Computer Science 2025-08-05 Pengcheng Zhou , Yinglun Feng , Zhongliang Yang

Processing-using-DRAM has been proposed for a limited set of basic operations (i.e., logic operations, addition). However, in order to enable full adoption of processing-using-DRAM, it is necessary to provide support for more complex…

DRAM chips are vulnerable to read disturbance phenomena (e.g., RowHammer and RowPress), where repeatedly accessing or keeping open a DRAM row causes bitflips in nearby rows. Attackers leverage RowHammer bitflips in real systems to take over…

Light beams carrying orbital angular momentum (OAM) possess an unbounded set of orthogonal modes, offering significant potential for optical communication and security. However, exploiting OAM beams in space has been hindered by the lack of…

Motivated by the applications of secure multiparty computation as a privacy-protecting data analysis tool, and identifying oblivious transfer as one of its main practical enablers, we propose a practical realization of randomized quantum…

Despite widespread interest in multicore computing, concur- rency models in mainstream languages often lead to subtle, error-prone code. Observationally Cooperative Multithreading (OCM) is a new approach to shared-memory parallelism.…

Non-orthogonal multiple access (NOMA) is a promising solution for secure transmission under massive access. However, in addition to the uncertain channel state information (CSI) of the eavesdroppers due to their passive nature, the CSI of…

Information Theory · Computer Science 2020-07-28 Zongze Li , Minghua Xia , Miaowen Wen , Yik-Chung Wu

Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size…

The utilization of large foundational models has a dilemma: while fine-tuning downstream tasks from them holds promise for making use of the well-generalized knowledge in practical applications, their open accessibility also poses threats…

Machine Learning · Computer Science 2025-04-22 Song Xia , Wenhan Yang , Yi Yu , Xun Lin , Henghui Ding , Ling-Yu Duan , Xudong Jiang

We present a framework for fully-simulatable $h$-out-of-$n$ oblivious transfer ($OT^{n}_{h}$) with security against non-adaptive malicious adversaries. The framework costs six communication rounds and costs at most $40n$ public-key…

Cryptography and Security · Computer Science 2011-04-04 Bing Zeng , Xueming Tang , Chingfang Hsu

In this paper, we introduce a formal notion of partial compliance, called Attack-resistance, of a computer program running together with a defense mechanism w.r.t a non-exploitability specification. In our setting, a program may contain…

Cryptography and Security · Computer Science 2015-06-15 Vijay Ganesh , Sebastian Banescu , Martín Ochoa

Universal Circuits (UCs) offer a promising approach to hardware Intellectual Property (IP) obfuscation, leveraging cryptographic principles to hide both structure and function in a programmable logic fabric. Their adaptability makes them…

Cryptography and Security · Computer Science 2026-04-07 Zain Ul Abideen , Deepali Garg , Lawrence Pileggi , Samuel Pagliarini

Oblivious transfer is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately, oblivious transfer cannot be achieved in an unconditionally secure way…

Cryptography and Security · Computer Science 2007-05-23 Jürg Wullschleger

Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional…

Quantum Physics · Physics 2017-03-21 Li Yang

Resistive random-access memory (ReRAM) is a promising candidate for the next generation non-volatile memory technology due to its simple read/write operations and high storage density. However, its crossbar array structure causes a severe…

Information Theory · Computer Science 2020-10-26 Guanghui Song , Kui Cai , Xingwei Zhong , Jiang Yu , Jun Cheng

A framework is proposed for the design and analysis of \emph{network-oblivious algorithms}, namely, algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and…

Data Structures and Algorithms · Computer Science 2014-04-15 Gianfranco Bilardi , Andrea Pietracaprina , Geppino Pucci , Michele Scquizzato , Francesco Silvestri