Dates are inconsistent

Dates are inconsistent

4 results sorted by ID

Possible spell-corrected query: due-duplication
2024/1301 (PDF) Last updated: 2024-08-20
Kalos: Hierarchical-auditable and Human-binding Authentication Scheme for Clinical Trial
Chang Chen, Zelong Wu, Guoyu Yang, Qi Chen, Wei Wang, Jin Li
Public-key cryptography

Clinical trials are crucial in the development of new medical treatment methods. To ensure the correctness of clinical trial results, medical institutes need to collect and process large volumes of participant data, which has prompted research on privacy preservation and data reliability. However, existing solutions struggle to resolve the trade-off between them due to the trust gap between the physical and digital worlds, limiting their practicality. To tackle the issues above, we present...

2023/658 (PDF) Last updated: 2023-05-10
A note on ``faster and efficient cloud-server-aided data de-duplication scheme with an authenticated key agreement for Industrial Internet-of-Things''
Zhengjun Cao, Lihua Liu
Attacks and cryptanalysis

We show that the data de-duplication scheme [Internet of Things, 2021(14): 100376] is flawed. (1) There are some inconsistent notations and false equations, which should be corrected. (2) The scheme fails to keep user anonymity, not as claimed. (3) The scheme could fail to keep data confidentiality.

2020/907 (PDF) Last updated: 2020-07-18
Enhanced Flush Reload Attack on AES
Milad Seddigh, Hadi Soleimany
Implementation

In cloud computing, multiple users can share the same physical machine that can potentially leak secret information, in particular when the memory de-duplication is enabled. Flush Reload attack is a cache-based attack that makes use of resource sharing. T-table implementation of AES is commonly used in the crypto libraries like OpenSSL. Several Flush Reload attacks on T-table implementation of AES have been proposed in the literature which requires a notable number of encryptions. In this...

2014/867 (PDF) Last updated: 2015-02-15
Random-Oracle Uninstantiability from Indistinguishability Obfuscation
Chris Brzuska, Pooya Farshim, Arno Mittelbach
Foundations

Assuming the existence of indistinguishability obfuscation (iO), we show that a number of prominent transformations in the random-oracle model are uninstantiable in the standard model. We start by showing that the Encrypt-with-Hash transform of Bellare, Boldyreva and O'Neill (CRYPTO 2007) for converting randomized public-key encryption schemes to deterministic ones is not instantiable in the standard model. To this end, we build on the recent work of Brzuska, Farshim and Mittelbach (CRYPTO...

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.