scholarly journals Toward Practical Secure Stable Matching

2017 ◽  
Vol 2017 (1) ◽  
pp. 62-78 ◽  
Author(s):  
M. Sadegh Riazi ◽  
Ebrahim M. Songhori ◽  
Ahmad-Reza Sadeghi ◽  
Thomas Schneider ◽  
Farinaz Koushanfar
Keyword(s):  
Stable Matching ◽  
Sensitive Information ◽  
Stable Match ◽  
Computation Cost ◽  
Oblivious Ram ◽  
Financial Applications ◽  
Novel Technique ◽  
Highly Sensitive ◽  
Garbled Circuit ◽  
Provably Secure

Abstract The Stable Matching (SM) algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP) and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao’s garbled circuit protocol and Oblivious RAM (ORAM). Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.

Who is Guarding the Doors

2011 ◽  
pp. 299-315
Author(s):  
Manish Gupta ◽  
Pradeep Kumar KB ◽  
H. R. Rao
Keyword(s):  
Recent Trend ◽  
Internet Banking ◽  
Online Banking ◽  
Sensitive Information ◽  
Banking Services ◽  
Highly Sensitive ◽  
Public Channel ◽  
Social Demographics ◽  
The Cost ◽  
Use Of Internet

Internet banking has become the preferred channel for conducting banking activities across globe and amongst all social demographics. Only a few other technological adoptions can compare with the recent trend of use of Internet banking facilities. Given the cost advantages and benefits it has to offer, it is widely touted as a win-win strategy for both banks and customers. However, with the growth in E-banking services and reliance on a public channel–Internet–to conduct business, it has been challenging for banks to ensure integrity and confidentiality of highly sensitive information. This chapter presents an overview of authentication issues and challenges in the online banking area with analysis on some of the better approaches. The chapter compares different authentication methods and discusses ensuing issues. The chapter will be invaluable for managers and professionals in understanding the current authentication landscape.

When travellers’ expectations are not met

2020 ◽  
pp. 1-28
Author(s):  
María de la O Hernández-López
Keyword(s):  
Sharing Economy ◽  
Sensitive Information ◽  
Review System ◽  
Communicative Skills ◽  
Online System ◽  
Negative Valence ◽  
Rapport Management ◽  
Highly Sensitive ◽  
The Difference ◽  
Relational Concerns

Abstract In recent years, travellers have increasingly opted for sharing economy businesses, such as Airbnb. In contrast to other platforms for travellers, the Airbnb review system is characterised by its positivity bias, which implies that most of the users post enthusiastically positive reviews. Posting a negative review is the exception, which makes it a highly sensitive task in relational terms. In light of the above, this study aims to examine 60 reviews with negative valence in order to understand: first, which aspects of the experience make airbnbers feel dissatisfied; second, the extent to which relational concerns and authenticity make an impact on both dissatisfaction and rapport orientation; and third, how rapport concerns (i.e., face and rights and obligations) are managed in reviews with negative valence. The results show that a large number of users tried to repair rapport, while others neglected or challenged rapport. The difference in tone and intention was motivated by the presence/absence of the relational component (i.e., association rights), which had an impact on the varying importance given to other faults. The present study intends to bring to the fore the importance of rapport management when posting sensitive information in an online system in which the management of communicative skills lies at its core.

Novel Technique for Highly Sensitive Timing Jitter Measurements

2005 ◽  
Author(s):  
R. Paschotta ◽  
B. Rudin ◽  
A. Schlatter ◽  
S. C. Zeller ◽  
G. J. Spuhler ◽  
...  
Keyword(s):  
Timing Jitter ◽  
Novel Technique ◽  
Highly Sensitive

Father, Son, and the Bomb

2015 ◽  
Vol 17 (4) ◽  
pp. 166-174
Author(s):  
Gary Kern
Keyword(s):  
World War Ii ◽  
Soviet Union ◽  
Manhattan Project ◽  
Sensitive Information ◽  
World War ◽  
The Soviet Union ◽  
Highly Sensitive ◽  
Foreign Intelligence ◽  
Intelligence Service

This essay discusses the memoir of Boria Sax, the son of Saville Sax, a U.S. citizen who was a Communist and Soviet spy during World War II. Saville Sax failed at most things he attempted, but he proved to be a valuable asset for Soviet espionage agencies because he was the roommate of the gifted physicist Theodore Hall, who was recruited to work for the Manhattan Project. Sax convinced Hall, who shared Sax's admiration of the Soviet Union, to supply highly sensitive information to the Soviet foreign intelligence service. The memoir offers a poignant view of the terrible impact that Saville Sax's actions had on his family as well as on the country he betrayed.

scholarly journals Practical and Provably Secure Distributed Aggregation: Verifiable Additive Homomorphic Secret Sharing

Cryptography ◽  
2020 ◽  
Vol 4 (3) ◽  
pp. 25
Author(s):  
Georgia Tsaloli ◽  
Gustavo Banegas ◽  
Aikaterini Mitrokotsa
Keyword(s):  
Secret Sharing ◽  
Security And Privacy ◽  
Sensitive Information ◽  
Signature Scheme ◽  
Secret Data ◽  
Public Verifiability ◽  
Client Side ◽  
Homomorphic Signatures ◽  
Multiple Clients ◽  
Provably Secure

Often clients (e.g., sensors, organizations) need to outsource joint computations that are based on some joint inputs to external untrusted servers. These computations often rely on the aggregation of data collected from multiple clients, while the clients want to guarantee that the results are correct and, thus, an output that can be publicly verified is required. However, important security and privacy challenges are raised, since clients may hold sensitive information. In this paper, we propose an approach, called verifiable additive homomorphic secret sharing (VAHSS), to achieve practical and provably secure aggregation of data, while allowing for the clients to protect their secret data and providing public verifiability i.e., everyone should be able to verify the correctness of the computed result. We propose three VAHSS constructions by combining an additive homomorphic secret sharing (HSS) scheme, for computing the sum of the clients’ secret inputs, and three different methods for achieving public verifiability, namely: (i) homomorphic collision-resistant hash functions; (ii) linear homomorphic signatures; as well as (iii) a threshold RSA signature scheme. In all three constructions, we provide a detailed correctness, security, and verifiability analysis and detailed experimental evaluations. Our results demonstrate the efficiency of our proposed constructions, especially from the client side.

scholarly journals Physical cryptographic verification of nuclear warheads

2016 ◽  
Vol 113 (31) ◽  
pp. 8618-8623 ◽  
Author(s):  
R. Scott Kemp ◽  
Areg Danagoulian ◽  
Ruaridh R. Macdonald ◽  
Jayson R. Vavrek
Keyword(s):  
Nuclear Weapon ◽  
Proof System ◽  
Interactive Proof ◽  
Highly Sensitive ◽  
Tomographic Method ◽  
Nuclear Arms Control ◽  
Arbitrary Precision ◽  
Interactive Proof System ◽  
Nuclear Warhead ◽  
Provably Secure

How does one prove a claim about a highly sensitive object such as a nuclear weapon without revealing information about the object? This paradox has challenged nuclear arms control for more than five decades. We present a mechanism in the form of an interactive proof system that can validate the structure and composition of an object, such as a nuclear warhead, to arbitrary precision without revealing either its structure or composition. We introduce a tomographic method that simultaneously resolves both the geometric and isotopic makeup of an object. We also introduce a method of protecting information using a provably secure cryptographic hash that does not rely on electronics or software. These techniques, when combined with a suitable protocol, constitute an interactive proof system that could reject hoax items and clear authentic warheads with excellent sensitivity in reasonably short measurement times.

scholarly journals SecureVision: An Open-Source User-Customizable Image Encryption Program

2021 ◽  
Vol 11 (17) ◽  
pp. 7915
Author(s):  
Mehrdad Shahmohammadi Beni ◽  
Hiroshi Watabe ◽  
Kwan Ngok Yu
Keyword(s):  
Image Encryption ◽  
Random Number Generator ◽  
Sensitive Information ◽  
Brute Force ◽  
File Transfer ◽  
Highly Sensitive ◽  
Custom Made ◽  
Encryption And Decryption ◽  
User Friendly ◽  
Program Modules

Data security has become indispensable, with a view to keep sensitive information confidential. One important method is through image encryption, upon which features in an image would no longer be visible. The original image with its features could only be restored upon decryption using a set of keys. There are prestigious works in the literature regarding image encryption. However, there is a lack of easy-to-use, GUI-based, user-customizable computer programs for image encryption. In the present work, we developed a GUI-based image encryption and decryption program with server file transfer support, namely, SecureVision. A custom-made random number generator using the equation of an ellipse was developed to randomly shuffle the pixel positions. SecureVision was found to be robust, user-friendly and fast in both encryption and decryption. The program was highly sensitive to the supplied keys, which prevented brute-force attacks. SecureVision provided full user control, where users could modify the program modules to match their desired applications, which was particularly desirable for pedagogical purposes in that interested parties had the freedom to explore the concept of image encryption and decryption. SecureVision is distributed under a GPLv3 license, which would allow everyone to use, modify and distribute the program without any restriction.

scholarly journals Quantitative Study of Photoelectric Laser Stimulation for Logic State Imaging in Embedded SRAM

2021 ◽  
Author(s):  
S. Chef ◽  
C.T. Chua ◽  
J.Y. Tay ◽  
C.L Gan
Keyword(s):  
Integrated Circuits ◽  
Sensitive Information ◽  
Laser Stimulation ◽  
Voltage Change ◽  
Current Voltage ◽  
Change Effect ◽  
Highly Sensitive ◽  
Potential Benefits ◽  
Logic State ◽  
Embedded Sram

Abstract The use of optical techniques for attacking integrated circuits (ICs) at the silicon level is increasingly being reported. Although these attacks can be complex to set and require skilled attacker that can access expensive equipment, they are nonetheless very powerful. Among the different applications described in literature, there has been a focus on extracting data directly from embedded SRAM. Such attacks can provide access to highly sensitive information such as encryption keys and bypass various security strategies. An attacker usually exploits one of the several interactions that exist between light and semiconductor to generate an image where content can be directly qualified by the data in memory (Logic State Image – LSI). Thermal laser stimulation (TLS) and laser probing (EOFM-Electro-Optical Frequency Mapping) have been reported in the literature recently but Photoelectric Laser Stimulation (PLS) did not get as much attention. Considering the potential advantages of PLS over other techniques (e.g. lower power requirements to generate current/voltage change, effect can be triggered at shorter wavelength which may lead to an improved spatial resolution), we investigate in this paper if logic state images can be generated with PLS on a variety of devices and do a comparative assessment with state-of-the-art technologies to assess potential benefits and limitations.

scholarly journals Vulnerable GPU Memory Management: Towards Recovering Raw Data from GPU

2017 ◽  
Vol 2017 (2) ◽  
pp. 57-73 ◽  
Author(s):  
Zhe Zhou ◽  
Wenrui Diao ◽  
Xiangyu Liu ◽  
Zhou Li ◽  
Kehuan Zhang ◽  
...  
Keyword(s):  
Operating Systems ◽  
Credit Card ◽  
Memory Management ◽  
Side Channel ◽  
Sensitive Information ◽  
Limited Information ◽  
Side Channel Attacks ◽  
Raw Data ◽  
Highly Sensitive ◽  
Novel Algorithm

Abstract According to previous reports, information could be leaked from GPU memory; however, the security implications of such a threat were mostly over-looked, because only limited information could be indirectly extracted through side-channel attacks. In this paper, we propose a novel algorithm for recovering raw data directly from the GPU memory residues of many popular applications such as Google Chrome and Adobe PDF reader. Our algorithm enables harvesting highly sensitive information including credit card numbers and email contents from GPU memory residues. Evaluation results also indicate that nearly all GPU-accelerated applications are vulnerable to such attacks, and adversaries can launch attacks without requiring any special privileges both on traditional multi-user operating systems, and emerging cloud computing scenarios.

Sign in / Sign up

Export Citation Format

Share Document