Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJune 2024
Privacy Preserving Biometric Authentication for Fingerprints and Beyond
CODASPY '24: Proceedings of the Fourteenth ACM Conference on Data and Application Security and PrivacyJune 2024, Pages 367–378https://doi.org/10.1145/3626232.3653269Biometric authentication eliminates the need for users to remember secrets and serves as a convenient mechanism for user authentication. Traditional implementations of biometric-based authentication store sensitive user biometry on the server and the ...
- research-articleMarch 2024
An efficient composable 1-out-of-2 oblivious transfer scheme using vector decomposition
International Journal of Advanced Intelligence Paradigms (IJAIP), Volume 27, Issue 22024, Pages 178–194https://doi.org/10.1504/ijaip.2024.137190A k-out-of-n oblivious transfer scheme is the interaction between a receiver and a sender where the sender possesses the messages m1, m2, … mn. The receiver needs to access k messages out of the n messages. The scheme is a mechanism in which the receiver ...
- research-articleNovember 2023
Efficient Set Membership Encryption and Applications
CCS '23: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications SecurityNovember 2023, Pages 1080–1092https://doi.org/10.1145/3576915.3623131The emerging area of laconic cryptography [Cho et al., CRYPTO'17] involves the design of two-party protocols involving a sender and a receiver, where the receiver's input is large. The key efficiency requirement is that the protocol communication ...
- research-articleJune 2023
Invited Paper: Oblivious Transfer Protocol without Physical Transfer of Hardware Root-of-Trust
ApPLIED 2023: Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systemsJune 2023, Article No.: 6, Pages 1–9https://doi.org/10.1145/3584684.3597273Oblivious Transfer (OT) protocol is nowadays recognised as a generic primitive for all cryptographic protocols since it is one of the strongest primitives for secure multiparty computation (MPC). To design hardware-assisted OT protocols, Physically ...
- research-articleDecember 2022
PPRP: Preserving-Privacy Route Planning Scheme in VANETs
ACM Transactions on Internet Technology (TOIT), Volume 22, Issue 4Article No.: 85, Pages 1–18https://doi.org/10.1145/3430507Route planning helps a vehicle to share a message with the roadside units (RSUs) on its path in advance, which greatly speeds the authentication between the vehicle and the RSUs when the vehicle enters the RSUs’ coverage. In addition, since only a small ...
-
- research-articleOctober 2022
Two-round Multiparty Secure Computation from Minimal Assumptions
Journal of the ACM (JACM), Volume 69, Issue 5Article No.: 36, Pages 1–30https://doi.org/10.1145/3566048We provide new two-round multiparty secure computation (MPC) protocols in the dishonest majority setting assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure against semi-honest ...
- research-articleSeptember 2022
Secure approximate pattern matching protocol via Boolean threshold private set intersection
International Journal of Intelligent Systems (IJIS), Volume 37, Issue 11November 2022, Pages 9245–9266https://doi.org/10.1002/int.22990AbstractApproximate pattern matching (APM) measures whether the Hamming distance between two strings is less than a threshold value. APM has been widely utilized, such as gene matching and facial recognition. Yet, the genetic data are privacy‐sensitive, ...
- research-articleNovember 2021
A PKI-based Framework for Establishing Efficient MPC Channels
CCS '21: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications SecurityNovember 2021, Pages 1961–1980https://doi.org/10.1145/3460120.3484806The Transport Layer Security (TLS) protocol is a fundamental building block for ensuring security on Internet. It provides an easy to use framework for the purposes of establishing an authenticated and secure channel between two parties that have never ...
- research-articleDecember 2020
Privacy-Preserving Production Process Parameter Exchange
- Jan Pennekamp,
- Erik Buchholz,
- Yannik Lockner,
- Markus Dahlmanns,
- Tiandong Xi,
- Marcel Fey,
- Christian Brecher,
- Christian Hopmann,
- Klaus Wehrle
ACSAC '20: Proceedings of the 36th Annual Computer Security Applications ConferenceDecember 2020, Pages 510–525https://doi.org/10.1145/3427228.3427248Nowadays, collaborations between industrial companies always go hand in hand with trust issues, i.e., exchanging valuable production data entails the risk of improper use of potentially sensitive information. Therefore, companies hesitate to offer ...
- research-articleNovember 2020
Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications SecurityOctober 2020, Pages 425–442https://doi.org/10.1145/3372297.3417870Symmetric password-authenticated key exchange (sPAKE) can be seen as an extension of traditional key exchange where two parties agree on a shared key if and only if they share a common secret (possibly low-entropy) password. We present the first sPAKE ...
- research-articleNovember 2020
Ferret: Fast Extension for Correlated OT with Small Communication
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications SecurityOctober 2020, Pages 1607–1626https://doi.org/10.1145/3372297.3417276Correlated oblivious transfer (COT) is a crucial building block for secure multi-party computation (MPC) and can be generated efficiently via OT extension. Recent works based on the pseudorandom correlation generator (PCG) paradigm presented a new way ...
- research-articleSeptember 2020
An efficient secure k nearest neighbor classification protocol with high‐dimensional features
International Journal of Intelligent Systems (IJIS), Volume 35, Issue 11November 2020, Pages 1791–1813https://doi.org/10.1002/int.22272Abstractk Nearest neighbor (kNN) classification algorithm is a prediction model which is widely used for real‐life applications, such as healthcare, finance, computer vision, personalization recommendation and precision marketing. The arrival of data ...
- research-articleNovember 2019
Efficient Multi-Party Private Set Intersection Against Malicious Adversaries
CCSW'19: Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security WorkshopNovember 2019, Pages 93–104https://doi.org/10.1145/3338466.3358927Private set intersection (PSI) enables parties to compute the intersection of their inputs without leaking any additional information. Recently, there have been significant advances in the two-party settings with malicious security, making two-party PSI ...
- research-articleNovember 2019
Endemic Oblivious Transfer
CCS '19: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications SecurityNovember 2019, Pages 309–326https://doi.org/10.1145/3319535.3354210Oblivious Transfer has played a crucial role in the design of secure multi party computation. Nevertheless, there are not many practical solutions that achieve simulation based security and at the same time instantiable based on different assumptions. ...
- research-articleAugust 2019
SET-OT: A Secure Equality Testing Protocol Based on Oblivious Transfer
ARES '19: Proceedings of the 14th International Conference on Availability, Reliability and SecurityAugust 2019, Article No.: 12, Pages 1–9https://doi.org/10.1145/3339252.3339264We propose a new secure equality testing (SET) protocol, namely SET-OT, for two-party setting by using a recently introduced Private Set Membership Protocol (PSM) based on Oblivious Transfer (OT) as a building block. We designed our equality test in ...
- articleAugust 2019
Universally composable oblivious transfer from ideal lattice
Frontiers of Computer Science: Selected Publications from Chinese Universities (FCS), Volume 13, Issue 4August 2019, Pages 879–906https://doi.org/10.1007/s11704-018-6507-4As a fundamental cryptographic primitive, oblivious transfer (OT) is developed for the sake of efficient usability and combinational feasibility. However, most OT protocols are built upon some quantum non-immune cryptosystems by assuming the hardness of ...
- research-articleOctober 2017
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case
CCS '17: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications SecurityOctober 2017, Pages 277–294https://doi.org/10.1145/3133956.3134100While the feasibility of constant-round and actively secure MPC has been known for over two decades, the last few years have witnessed a flurry of designs and implementations that make its deployment a palpable reality. To our knowledge, however, ...
- research-articleApril 2017
Private matching and set intersection computation in multi-agent and industrial control systems
CISRC '17: Proceedings of the 12th Annual Conference on Cyber and Information Security ResearchApril 2017, Article No.: 14, Pages 1–6https://doi.org/10.1145/3064814.3064817Distributed autonomous systems that rely on dataset matching and set intersection computation for decision making capabilities are vulnerable to datasets poisoning attacks. Among these systems, Industrial Control Systems (ICS) operating on critical ...
- research-articleOctober 2016
MASCOT: Faster Malicious Arithmetic Secure Computation with Oblivious Transfer
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications SecurityOctober 2016, Pages 830–842https://doi.org/10.1145/2976749.2978357We consider the task of secure multi-party computation of arithmetic circuits over a finite field. Unlike Boolean circuits, arithmetic circuits allow natural computations on integers to be expressed easily and efficiently. In the strongest setting of ...
- articleOctober 2016
Efficient oblivious transfer with adaptive queries in UC framework
Security and Communication Networks (SACN), Volume 9, Issue 15October 2016, Pages 2592–2611https://doi.org/10.1002/sec.1505We propose two efficient universally composable adaptivek-out-of-NOTk×1N protocols, secure in the presence of malicious adversary in static corruption model under the Decision Linear and q-Strong Diffie-Hellman assumptions. Our second scheme ...