Realizing an internet of secure things: A survey on issues and enabling technologies

SA Hamad, QZ Sheng, WE Zhang… - … Surveys & Tutorials, 2020 - ieeexplore.ieee.org
Since the term first coined in 1999, the Internet of Things (IoT) has gained significant
momentum in connecting physical objects to the Internet and facilitating machine-to-human …

Secure outsourced matrix computation and application to neural networks

X Jiang, M Kim, K Lauter, Y Song - … of the 2018 ACM SIGSAC conference …, 2018 - dl.acm.org
Homomorphic Encryption (HE) is a powerful cryptographic primitive to address privacy and
security issues in outsourcing computation on sensitive data to an untrusted computation …

From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

N Bitansky, R Canetti, A Chiesa, E Tromer - Proceedings of the 3rd …, 2012 - dl.acm.org
The existence of succinct non-interactive arguments for NP (ie, non-interactive
computationally-sound proofs where the verifier's work is essentially independent of the …

Securely outsourcing attribute-based encryption with checkability

J Li, X Huang, J Li, X Chen… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Attribute-Based Encryption (ABE) is a promising cryptographic primitive which significantly
enhances the versatility of access control mechanisms. Due to the high expressiveness of …

vSQL: Verifying arbitrary SQL queries over dynamic outsourced databases

Y Zhang, D Genkin, J Katz… - … IEEE Symposium on …, 2017 - ieeexplore.ieee.org
Cloud database systems such as Amazon RDS or Google Cloud SQLenable the
outsourcing of a large database to a server who then responds to SQL queries. A natural …

Delegating computation: interactive proofs for muggles

S Goldwasser, YT Kalai, GN Rothblum - Journal of the ACM (JACM), 2015 - dl.acm.org
In this work we study interactive proofs for tractable languages. The (honest) prover should
be efficient and run in polynomial time or, in other words, a “muggle”. 1 The verifier should …

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 …

Leveled fully homomorphic signatures from standard lattices

S Gorbunov, V Vaikuntanathan, D Wichs - Proceedings of the forty …, 2015 - dl.acm.org
In a homomorphic signature scheme, a user Alice signs some large dataset x using her
secret signing key and uploads the signed data to an untrusted remote server. The server …

How to delegate and verify in public: Verifiable computation from attribute-based encryption

B Parno, M Raykova, V Vaikuntanathan - … , Sicily, Italy, March 19-21, 2012 …, 2012 - Springer
The wide variety of small, computationally weak devices, and the growing number of
computationally intensive tasks makes it appealing to delegate computation to data centers …

Computer-aided security proofs for the working cryptographer

G Barthe, B Grégoire, S Heraud… - Annual Cryptology …, 2011 - Springer
We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic
systems from proof sketches–compact, formal representations of the essence of a proof as a …