Filters








29,915 Hits in 4.8 sec

Data-logging and supervisory control in wireless sensor networks

Aditya N. Das, Dan O. Popa, Prasanna Mohan Ballal, Frank L. Lewis
2009 International Journal of Sensor Networks (IJSNet)  
The DEC is responsible for generating rule-based tasks in order to address information-centric issues such as data-logging, alarm & event reporting and security.  ...  This paper proposes a data-logging & supervisory control architecture to manage the information gathered by the WSN and make decisions based on this information.  ...  Finally, data security requires restricting control of the DEC from unauthorized users. The DSC sets up security levels of security such as administrator, operator, guest etc.  ... 
doi:10.1504/ijsnet.2009.028022 fatcat:beheurzie5ef7li3ofmbokd77u

A Secure and Privacy-preserving Protocol for Smart Metering Operational Data Collection [article]

Mustafa A. Mustafa, Sara Cleemput, Abelrahaman Aly, Aysajan Abidin
2019 arXiv   pre-print
In this paper we propose a novel protocol that allows suppliers and grid operators to collect users' aggregate metering data in a secure and privacy-preserving manner.  ...  We use secure multiparty computation to ensure privacy protection.  ...  For instance, the Batcher oddeven merge sorting network requires |SM dj | × log 2 (|SM dj |) exchange gates.  ... 
arXiv:1801.08353v2 fatcat:5gk67zn55rf5rc3gadnmc2e3oi

A Secure and Privacy-preserving Protocol for Smart Metering Operational Data Collection

Mustafa A. Mustafa, Sara Cleemput, Abdelrahaman Aly, Aysajan Abidin
2019 IEEE Transactions on Smart Grid  
In this paper, we propose a novel protocol that allows suppliers and grid operators to collect users' aggregate metering data in a secure and privacy-preserving manner.  ...  We use secure multiparty computation to ensure privacy protection.  ...  For instance, the Batcher oddeven merge sorting network requires |SM dj | × log 2 (|SM dj |) exchange gates.  ... 
doi:10.1109/tsg.2019.2906016 fatcat:5b3gtnez3zgzhmxvslrwsowkn4

Building Secure and Transparent Elections through Standard Operating Procedures

R. Michael Alvarez, Thad E. Hall
2008 PAR. Public Administration Review  
However, basic processes and standard operating procedures have not been uniformly adopted across the states for the security of the voting systems.  ...  seals, logs, and witnesses requires the establishment of appropriate processes and procedures.  ...  If secure storage space with restricted access is unavailable at the pol ling place, election offi cials must provide interlocking padlocked cables to secure voting units.  ... 
doi:10.1111/j.1540-6210.2008.00924.x fatcat:utfmxp5kvrcjzkanaqwydlgslu

Performance Evaluation and Operation of Enterprise Resource Planning (ERP) Software Security System

Diponkar Paul
2014 International Journal of Intelligent Information Systems  
ERP for the business to develop innovative services for new and existing organizations, has achieved operational excellence with streamlined logistics and manufacturing improve financial performance with  ...  The applied framework has been used to map a commercial security library to the target mobile application SoC (System-of-Chip).  ...  three associated arguments; O is the security-related operation performed by the principal i in a compositional contract; K is a set of security attributes used by the principal; subscript j contains  ... 
doi:10.11648/j.ijiis.20140305.11 fatcat:cokovldx2bhrncolsi6atrvrsi

OPEC

Xia Zhou, Jiaqi Li, Wenlong Zhang, Yajin Zhou, Wenbo Shen, Kui Ren
2022 Proceedings of the Seventeenth European Conference on Computer Systems  
Bare-metal embedded systems usually lack security isolation. Attackers can subvert the whole system with a single vulnerability.  ...  Our evaluation shows that OPEC can achieve the security guarantees for the privilege and resource isolation with negligible runtime overhead (average 0.23%), moderate Flash overhead (average 1.79%), and  ...  After that, the OPEC-Compiler groups all the member functions callable from one operation entry to an operation and merges all needed resources to produce the resource dependency.  ... 
doi:10.1145/3492321.3519573 fatcat:m2o5uyxkqbegbpz5x67w6n5vbm

A Survey on TLS-Encrypted Malware Network Traffic Analysis Applicable to Security Operations Centers

Chaeyeon Oh, Joonseo Ha, Heejun Roh
2021 Applied Sciences  
Recently, a majority of security operations centers (SOCs) have been facing a critical issue of increased adoption of transport layer security (TLS) encryption on the Internet, in network traffic analysis  ...  To this end, in this survey article, we present existing research on NTA and related areas, primarily focusing on TLS-encrypted traffic to detect and classify malicious traffic with deployment scenarios  ...  Santos, O. Network Security with NetFlow and IPFIX: Big Data Analytics for Information Security; Cisco Press: Indianapolis, IN, USA, 2015. 9. ENEA Qosmos Division.  ... 
doi:10.3390/app12010155 fatcat:kdkvmdkbareb7cxgy7er7ncday

Fine-CFI: Fine-Grained Control-Flow Integrity for Operating System Kernels

Jinku Li, Xiaomeng Tong, Fengwei Zhang, Jianfeng Ma
2018 IEEE Transactions on Information Forensics and Security  
Operating system kernel is often the security foundation for the whole system.  ...  Unlike previous systems, FINE-CFI constructs kernel's finegrained CFG with a retrofitted context-sensitive and fieldsensitive pointer analysis, then enforces CFI with this CFG.  ...  The detailed log is available in /var/log/kern.log file in the hypervisor (lines 1-6). In particular, in kern.log, we found that an error occurred in line 2 (marked with *).  ... 
doi:10.1109/tifs.2018.2797932 fatcat:2r2xdz7pybb6fbbfumo6upukfm

Secure data structures based on multi-party computation

Tomas Toft
2011 Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing - PODC '11  
The priority queue operations -insertion into the structure and deletion of the minimal element contained therein -both require O(log 2 n) invocations of the cryptographic primitives (secure arithmetic  ...  and comparison) amortized in O(1) rounds amortized, where n is the overall number of operations performed.  ...  For the case of passively secure MPC from Shamir's secret sharing scheme, the O(log 2 n) conditional swaps translate into O(log M · log 2 n) basic operations of F ABB , which in turn require O(log M ·  ... 
doi:10.1145/1993806.1993859 dblp:conf/podc/Toft11 fatcat:pvq272j3k5dmjc6mebrznd27my

Asymptotically Tight Bounds for Composing ORAM with PIR [chapter]

Ittai Abraham, Christopher W. Fletcher, Kartik Nayak, Benny Pinkas, Ling Ren
2017 Lecture Notes in Computer Science  
log 3 N ) to O(log N ) where N is the number of logical data blocks.  ...  We also show a Ω(log cD N ) lower bound on bandwidth blowup in the modified model involving PIR operations.  ...  Our construction achieves O(log d N ) bandwidth blowup with c = O(1) blocks of client storage and PIR operations on D = d · polylog(N ) blocks.  ... 
doi:10.1007/978-3-662-54365-8_5 fatcat:adzojsnhwnan3dlwu57zdyxzoq

Constant Communication ORAM with Small Blocksize

Tarik Moataz, Travis Mayberry, Erik-Oliver Blass
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
It requires a large block size of B = Ω(log 6 N ) with large constants.  ...  In this work, we address these problems and reduce the required block size to Ω(log 4 N ). We remove most of the homomorphic multiplications while maintaining O(1) communication complexity.  ...  With z ∈ Θ(λ), λ ∈ ω(log N ) and L ∈ Θ(log N ), we achieve B ∈ Ω(λ · [log N · log λ + γ]). In practice, γ ∈ O(λ 3 ), so γ dominates log N · log λ. Therefore, block size B is B ∈ Ω(γλ).  ... 
doi:10.1145/2810103.2813701 dblp:conf/ccs/MoatazMB15 fatcat:qgcy6awkffggpeeoje4zjb23tq

More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting [article]

T-H. Hubert Chan and Jonathan Katz and Kartik Nayak and Antigoni Polychroniadou and Elaine Shi
2018 arXiv   pre-print
In this work, we construct a perfectly secure 3-server ORAM scheme that outperforms the best known single-server scheme by a logarithmic factor.  ...  ., whether the multi-server setting can be used to achieve stronger security goals or provably better efficiency than is possible in the single-server case.  ...  [15] O(log N ) O(N ) Computational Kushilevitz et al. [18] O(log N · ω(1)) O(log N · ω(1)) Computational Abraham et al. [1] O(log 2 N · ω(1)) O(log 2 N · ω(1)) Statistical Our work O(log 2 N ) - Perfect  ... 
arXiv:1809.00825v1 fatcat:srh3i7cyfnhftbghbvhwhad43q

Privacy-Preserving Computation with Trusted Computing via Scramble-then-Compute

Hung Dang, Tien Tuan Anh Dinh, Ee-Chien Chang, Beng Chin Ooi
2017 Proceedings on Privacy Enhancing Technologies  
We consider privacy-preserving computation of big data using trusted computing primitives with limited private memory.  ...  In this paper, we advocate a simple approach wherein many basic algorithms (e.g., sorting) can be made privacy-preserving by adding a step that securely scrambles the data before feeding it to the original  ...  O(n log 2 n) Compaction O(n) O(n) O(n log n) Selection O(n) O(n) O(n) Aggregation O(n log n) O(n log n) O(n log n) Join O(n 1 log n 1 + n 2 log n 2 ) O(n 1 log n 1 + n 2 log n 2 + l log l) O(n 1 log n  ... 
doi:10.1515/popets-2017-0026 dblp:journals/popets/DangDCO17 fatcat:25kvpphyyjgolcsv5refjcp5y4

Building castles out of mud

Peter Williams, Radu Sion, Bogdan Carbunar
2008 Proceedings of the 15th ACM conference on Computer and communications security - CCS '08  
Moreover, the client is provided with strong correctness assurances for its operations -illicit provider behavior does not go undetected.  ...  We introduce a new practical mechanism for remote data storage with efficient access pattern privacy and correctness.  ...  on level i is O(4 i (log log 4 i + 1)) = O(4 i log i) = O(n log log n).  ... 
doi:10.1145/1455770.1455790 dblp:conf/ccs/WilliamsSC08 fatcat:57quqjkmwraohoh3akueil32ae

BIOS ORAM: Improved Privacy-Preserving Data Access for Parameterized Outsourced Storage [article]

Michael T. Goodrich
2017 arXiv   pre-print
Our method achieves statistical security for hiding Alice's access pattern and, with high probability, achieves an I/O overhead that ranges from O(1) to O(^2 n/( n)^2), depending on these size parameters  ...  , where n is the size of Alice's outsourced memory.  ...  O(log n/ log B) with high probability.  ... 
arXiv:1709.06534v1 fatcat:g4n6waniuvc6je2s3qlqeuvhji
« Previous Showing results 1 — 15 out of 29,915 results