Protection
By W. Wheaton, Dabney P. Evans, Mark Anderson, Mark Anderson. 2018
4,794 citations recorded by the source corpus.
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Jihong Park
- Medhi Bennis
- Praneeth Vepakomma
- Xiongfeng Ma
- Feihu Xu
- Hoi-Kwong Lo
- Hyowoon Seo
- Ramesh Raskar
Citations in the corpus
- A Review of Homomorphic Encryption Libraries for Secure Computation (2018, background): “Partially Homomorphic Encryption (PHE) schemes such as [9,10,11,12,13,14,15,16,17,18,19] allow only one type of operation any number of times - either addition or multiplication on encrypted data as compared to Somewhat Homomorphic schemes that support both.”
- Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption (2016, background): “in [7, 1978], and the first fully homomorphic encryption (FHE) scheme that supports arbitrary computations on encrypted data was constructed by G e n t r y [4].”
- Secure and Privacy-Preserving Consensus (2017, background): “Most popular cryptosystems such as RSA [24], ElGamal [25], and Paillier [26] are public-key cryptosystems.”
- Secure multiparty aggregation with differential privacy: a comparative study (2013, background): “In Proc. of the 12th Conf. on Topics in Cryptology, CT-RSA, pages 313 331, 2012.”
- Secure quantum key distribution with realistic devices (2020, background): “For instance, the security of the best-known public key crypto-system, RSA (Rivest et al., 1978), is based on the presumed hardness of factoring large integers.”
- Apex: extending Android permission model and enforcement with user-defined runtime constraints (2010, unknown): “In system-level permission models [22, 2, 20], policies are based on processes, users, resources and rights.”
- The Algorithm Design Manual (2020, methodology): “This was particularly noteworthy because in the original RSA paper [RSA78] they had origi-”
- Communication and Consensus Co-Design for Low-Latency and Reliable Industrial IoT Systems (2019, background): “We assume that the messages are contain public-key signatures [24], message authentication codes [25], and message digests produced by collision-resistant hash functions [26].”