Search Results - Proceedings of the ... ACM Conference on Computer and Communications Security

Shorter ZK-SNARKs from square span programs over ideal lattices by Lin, Xi, Cao, Heyang, Liu, Feng-Hao, Wang, Zhedong, Wang, Mingsheng

“…Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) are cryptographic protocols that offer efficient and privacy-preserving means of…”
Get full text

Manticore: A Framework for Efficient Multiparty Computation Supporting Real Number and Boolean Arithmetic by Belorgey, Mariya Georgieva, Carpov, Sergiu, Deforth, Kevin, Jetchev, Dimitar, Sae-Tang, Abson, Vuille, Marius, Gama, Nicolas, Katz, Jon, Leontiadis, Iraklis, Mohammadi, Mohsen

“… (Mohassel and Zhang, in 2017 IEEE symposium on security and privacy (SP), 2017; Mohassel and Rindal, in Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, 2018…”
Get full text

Generic constructions of PoRs from codes and instantiations by Lavauzelle Julien, Levy-dit-Vehel Françoise

“… (typically 512 bits). We adapt the security model initiated by Juels and Kaliski [PoRs: Proofs of retrievability for large files, Proceedings of the 2007 ACM Conference on Computer and Communications Security…”
Get full text

Reusable Fuzzy Extractors for Low-Entropy Distributions by Canetti, Ran, Fuller, Benjamin, Paneth, Omer, Reyzin, Leonid, Smith, Adam

“… Reusable fuzzy extractors (Boyen, in Proceedings of the 11th ACM conference on computer and communications security, CCS, ACM, New York, 2004, pp 82–91…”
Get full text

Design and implementation of low-depth pairing-based homomorphic encryption scheme by Herbert, Vincent, Biswas, Bhaskar, Fontaine, Caroline

“…–Goh–Nissim (BGN for short) encryption scheme (Boneh et al. in Kilian J (ed) Theory of cryptography, second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10–12, 2005…”
Get full text

Strongly nonoutsourceable scratch-off puzzles in blockchain by Zeng, Gongxian, Huang, Zhengan, Wang, Yu, Mu, Xin, Zhang, Cheng

“… in Proceedings of the 22nd ACM SIGSAC conference on computer and communications security, 2015…”
Get full text

Secure group key establishment revisited by Bohli, Jens-Matthias, González Vasco, María Isabel, Steinwandt, Rainer

“… (LNCS 2248: 290-309, 2001; Proceedings of the 8th ACM conference on computer and communications security (CCS-8), 2001…”
Get full text

Privacy preserving support vector machine based on federated learning for distributed IoT‐enabled data analysis by Chen, Yu‐Chi, Hsu, Song‐Yi, Xie, Xin, Kumari, Saru, Kumar, Sachin, Rodrigues, Joel, Alzahrani, Bander A.

“…In a smart city, IoT devices are required to support monitoring of normal operations such as traffic, infrastructure, and the crowd of people. IoT‐enabled…”
Get full text

Technical, legal and ethical dilemmas: distinguishing risks arising from malware and cyber-attack tools in the ‘cloud’—a forensic computing perspective by Broucek, Vlasti, Turner, Paul

“… in Proceedings of the 14th ACM conference on computer and communications security, pp 103–115, 2009 ; Pearson in CLOUD’09, pp 44–52, 2009 ; Vouk in J Comput Inf Technol 4…”
Get full text

RAICC: Revealing Atypical Inter-Component Communication in Android Apps by Samhi, Jordan, Bartel, Alexandre, Bissyande, Tegawende F., Klein, Jacques

“…Inter-Component Communication (ICC) is a key mechanism in Android. It enables developers to compose rich functionalities and explore reuse within and across apps…”
Get full text

Asymptotically Free Broadcast in Constant Expected Time via Packed VSS by Abraham, Ittai, Asharov, Gilad, Patil, Shravani, Patra, Arpita

“… While broadcast with worst case t rounds is impossible, it has been shown (Feldman and Micali, in Proceedings of the 20th annual ACM symposium on theory of computing, 1988, Katz and Koo, in Annual international cryptology conference, 2006…”
Get full text

A Partial Replication of "RAICC: Revealing Atypical Inter-Component Communication in Android Apps" by Samhi, Jordan, Bartel, Alexandre, Bissyande, Tegawende F., Klein, Jacques

“…This short paper presents the artefacts related to our ICSE 2021 research paper…”
Get full text

Generalized XML security views by Kuper, Gabriel, Massacci, Fabio, Rassadko, Nataliya

“… (Proceedings of the 16th International Conference on Data and Applications Security (IFIP’02). IFIP Conference Proceedings, vol…”
Get full text

On-device Malware Detection using Performance-Aware and Robust Collaborative Learning by Shukla, Sanket, Sai Manoj, P D, Kolhe, Gaurav, Rafatirad, Setareh

“… Lack of proper security protocols in such devices makes them vulnerable to cyber threats, especially malware attacks…”
Get full text

Practical attacks on a mutual authentication scheme under the EPC Class-1 Generation-2 standard by Peris-Lopez, Pedro, Li, Tieyan, Hernandez-Castro, Julio C., Tapiador, Juan M.E.

“… Nesterenko, RFID security without extensive cryptography, in: Proceedings of the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks, 2005, pp. 63–67; D.N. Duc, J. Park, H. Lee, K…”
Get full text

Invited: Waving the Double-Edged Sword: Building Resilient CAVs with Edge and Cloud Computing by Liu, Xiangguo, Luo, Yunpeng, Goeckner, Anthony, Chakraborty, Trishna, Jiao, Ruochen, Wang, Ningfei, Wang, Yixuan, Sato, Takami, Chen, Qi Alfred, Zhu, Qi

“… (vehicle-to-everything) communication expose vulnerabilities to various disturbances and attacks…”
Get full text

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions by Komargodski, Ilan, Segev, Gil, Yogev, Eylon

“…) offering various trade-offs between security and efficiency. Previously, Goyal et al. (Proceedings of the 12th theory of cryptography conference (TCC), pp 325–351, 2015…”
Get full text

Autonomous Network Defence using Reinforcement Learning by Foley, Myles, Hicks, Chris, Highnam, Kate, Mavroudis, Vasilios

“…In the network security arms race, the defender is significantly disadvantaged as they need to successfully detect and counter every malicious attack…”
Get full text

Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious by Alon, Bar, Omri, Eran

“… (in: Proceedings of the 18th annual ACM symposium on theory of computing (STOC), 1986) has shown that if half of the parties can be corrupted, then no r -round coin-tossing protocol is o ( 1 / r ) -fair…”
Get full text

What All the PHUZZ Is About: A Coverage-guided Fuzzer for Finding Vulnerabilities in PHP Web Applications by Neef, Sebastian, Lorenz Kleissner, Seifert, Jean-Pierre

“…Coverage-guided fuzz testing has received significant attention from the research community, with a strong focus on binary applications, greatly disregarding…”
Get full text