A comprehensive survey of cryptography key management systems

S Rana, FK Parast, B Kelly, Y Wang, KB Kent - Journal of Information …, 2023 - Elsevier
Cryptographic methods have been extensively employed in various systems to address
security objectives, such as data confidentiality, authentication, and secure communication …

Attribute-based encryption with parallel outsourced decryption for edge intelligent IoV

C Feng, K Yu, M Aloqaily, M Alazab… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Edge intelligence is an emerging concept referring to processes in which data are collected
and analyzed and insights are delivered close to where the data are captured in a network …

Private circuits: Securing hardware against probing attacks

Y Ishai, A Sahai, D Wagner - Advances in Cryptology-CRYPTO 2003: 23rd …, 2003 - Springer
Can you guarantee secrecy even if an adversary can eavesdrop on your brain? We consider
the problem of protecting privacy in c ircuits, when faced with an adversary that can access a …

Lest we remember: cold-boot attacks on encryption keys

JA Halderman, SD Schoen, N Heninger… - Communications of the …, 2009 - dl.acm.org
Contrary to widespread assumption, dynamic RAM (DRAM), the main memory in most
modern computers, retains its contents for several seconds after power is lost, even at room …

Linear degree extractors and the inapproximability of max clique and chromatic number

D Zuckerman - Proceedings of the thirty-eighth annual ACM …, 2006 - dl.acm.org
A randomness extractor is an algorithm which extracts randomness from a low-quality
random source, using some additional truly random bits. We construct new extractors which …

Revocation and tracing schemes for stateless receivers

D Naor, M Naor, J Lotspiech - … in Cryptology—CRYPTO 2001: 21st Annual …, 2001 - Springer
We deal with the problem of a center sending a message to a group of users such that some
subset of the users is considered revoked and should not be able to obtain the content of the …

Pseudorandomness

SP Vadhan - … and Trends® in Theoretical Computer Science, 2012 - nowpublishers.com
This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

[PDF][PDF] Vanish: Increasing Data Privacy with Self-Destructing Data.

R Geambasu, T Kohno, AA Levy, HM Levy - USENIX security symposium, 2009 - usenix.org
Today's technical and legal landscape presents formidable challenges to personal data
privacy. First, our increasing reliance on Web services causes personal data to be cached …

Leakage-resilient cryptography

S Dziembowski, K Pietrzak - 2008 49th Annual IEEE …, 2008 - ieeexplore.ieee.org
We construct a stream-cipher S whose implementation is secure even if a bounded amount
of arbitrary (adversarially chosen) information on the internal state ofS is leaked during …

Key-insulated public key cryptosystems

Y Dodis, J Katz, S Xu, M Yung - … on the Theory and Applications of …, 2002 - Springer
Cryptographic computations (decryption, signature generation, etc.) are often performed on
a relatively insecure device (eg, a mobile device or an Internet-connected host) which …