2,173 Hits in 3.4 sec

Cryptographically imposed model for Efficient Multiple Keyword-based Search over Encrypted Data in Cloud by Secure Index using Bloom Filter and False Random Bit Generator

Devi Thiyagarajan, R. Ganesan
2017 International Journal of Network Security  
Data is stored on remote location in cloud and cryptographic techniques resolve problems of data security.  ...  The paper proposes architecture of multiple keyword search by building index using Bloom filter and also pair key generation by false random bit generator.  ...  Since the hash value position is greater than 0 (i.e) 1, if the theorem generates false random bits and the cryptographic algorithm over secured access using Bloom filter is preserved.  ... 
dblp:journals/ijnsec/ThiyagarajanG17 fatcat:tdolee2adbao3pwo4vfcuox4ny

Survey On: Denial-of-Service Attacks with Bloom-Filters

Akshay Vinayak Parte, Mayur Jagannath Dhole, Anant Sunil Sonsale, Sharmila A. Chopade
2015 International Journal of Engineering Research and  
But using bloom-filters lead to possibility of DoS attacks in network, therefore the security mechanism of bloomfilter needs to be well tested against DoS attack.  ...  Bloom-filter is data structure which is stored in packet header.  ...  Before deploying bloom-filter-based forwarding on open networks bloom filters need further improvements on security.  ... 
doi:10.17577/ijertv4is090465 fatcat:yc34bb4asbconodfn5gecaln2m

Hardened Bloom Filters, with an Application to Unobservability

Nicolas Bernard, Franck Leprévost
2012 Annales UMCS Informatica  
This leads us to the concept of hardened Bloom filters, combining classical Bloom filters with cryptographic hash functions and secret nonces.  ...  Classical Bloom filters may be used to elegantly check if an element e belongs to a set S, and, if not, to add e to S.  ...  issues and Hardened Bloom filters As mentioned in the introduction (section 1), security issues may be raised in some applications.  ... 
doi:10.2478/v10065-012-0018-y fatcat:63s62jx5nzfs3fl5quilflg64q

The Power of Evil Choices in Bloom Filters

Thomas Gerbet, Amrit Kumar, Cedric Lauradoux
2015 2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks  
This paper raises the following important question: Are Bloom filters correctly designed in a security context?  ...  A Bloom filter is a probabilistic hash-based data structure extensively used in software including online security applications.  ...  The ideal hash function for Bloom filters should be an efficient and secure keyed hash function with extensible output. Recently, the NIST has released the SHA-3 standard [10] .  ... 
doi:10.1109/dsn.2015.21 dblp:conf/dsn/GerbetKL15 fatcat:suvydo7orndzpkmuzjrn6if5ky

Secure Privacy Preserving Record Linkage of Large Databases by Modified Bloom Filter Encodings

Rainer Schnell, Christian Borgs
2017 International Journal of Population Data Science  
By the application of suitable blocking strategies, linking can be done in reasonable time.ResultHowever, Bloom filters have been subject of cryptographic attacks.  ...  We will present new results on recently developed techniques to defy all known attacks on PPRL Bloom filters.  ...  Result However, Bloom filters have been subject of cryptographic attacks. Previous research has shown that the straight application of Bloom filters has a nonzero re-identification risk.  ... 
doi:10.23889/ijpds.v1i1.29 fatcat:6vtl5nhyqvdwrha7eoini66xay

Performances of cryptographic accumulators

Amrit Kumar, Pascal Lafourcade, Cedric Lauradoux
2014 39th Annual IEEE Conference on Local Computer Networks  
Cryptographic accumulators are space/time efficient data structures used to verify if a value belongs to a set.  ...  For n ≥ 12, even 2048-bit RSA accumulators are smaller than secure Bloom filter.  ...  They are the cryptographic counterpart of a data structure very popular in the field of networking: the Bloom filters [5, 7] .  ... 
doi:10.1109/lcn.2014.6925793 dblp:conf/lcn/KumarLL14 fatcat:jteyklz3pzbzvofb5o6y2nzcwi

A high-performance capabilities-based network protocol

Tilman Wolf, Kamlesh T. Vasudevan
2009 2009 5th IEEE Workshop on Secure Network Protocols  
Capabilities-based networks present a fundamental shift in the security design of network architectures.  ...  Our prototype implementation shows that there is some connection setup cost associated with this type of secure communication.  ...  Note that the Bloom filter indices are separate from the Bloom filter itself.  ... 
doi:10.1109/npsec.2009.5342257 fatcat:w6hcthqthbbihg422tcbvyyzym

A New Design for Alignment-Free Chaffed Cancelable Iris Key Binding Scheme

Tong-Yuen Chai, Bok-Min Goi, Yong-Haur Tay, and Zhe Jin
2019 Symmetry  
The experimental results and security analysis show the validity of the proposed scheme.  ...  The proposed system protects the binary biometric data, i.e., IrisCodes, from security and privacy attacks through a strong and size varying non-invertible cancelable transform.  ...  The independency of different bloom filters can be further strengthened by applying different public random permutations on the bloom filters.  ... 
doi:10.3390/sym11020164 fatcat:vlzzanowinekfbkmffyvah22c4

Design of a network architecture with inherent data path security

Tilman Wolf
2007 Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems - ANCS '07  
General Terms Design, Security  ...  Next-generation Internet architectures require designs with inherent security guarantees.  ...  The Bloom filter data structure superimposes credentials from each router along the path.  ... 
doi:10.1145/1323548.1323556 dblp:conf/ancs/Wolf07 fatcat:5mhzdaoqczcaxkr5u26mbtedai

An Overview of Cryptographic Accumulators [article]

Ilker Ozcelik, Sai Medury, Justin Broaddus, Anthony Skjellum
2021 arXiv   pre-print
This paper is a primer on cryptographic accumulators and how to apply them practically. A cryptographic accumulator is a space- and time-efficient data structure used for set-membership tests.  ...  Therefore, we address that gap by describing cryptographic accumulators while presenting their fundamental and so-called optional properties.  ...  bit-based data structures like the Bloom filter (Bloom, 1970a) , or its more recently proposed alternative called the cuckoo filter (Fan et al., 2014) .  ... 
arXiv:2103.04330v1 fatcat:jbu5yxvtazavfag37bdjp4jrr4

Similarity Preserving Hashing: Eligible Properties and a New Algorithm MRSH-v2 [chapter]

Frank Breitinger, Harald Baier
2013 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
One basic property of cryptographic hash functions is the avalanche effect that causes a significantly different output if an input is changed slightly.  ...  Inspired by cryptographic hash functions we distinguish between general properties (P1-P3) and security properties (P4-P5).  ...  Moreover MRSH reduces the MD5 hash value from 128 bits to 44 bits in order to insert it into the Bloom filter. Thus, the hash looses its cryptographic properties.  ... 
doi:10.1007/978-3-642-39891-9_11 fatcat:x45yhzgxkfgazjejdlhfp23k24

Options for encoding names for data linking at the Australian Bureau of Statistics [article]

Chris Culnane, Benjamin I. P. Rubinstein, Vanessa Teague
2018 arXiv   pre-print
In 2016, the ABS engaged the University of Melbourne to provide expert advice on cryptographic hash functions to meet this objective.  ...  Publicly, ABS has said it would use a cryptographic hash function to convert names collected in the 2016 Census of Population and Housing into an unrecognisable value in a way that is not reversible.  ...  Bloom filters.  ... 
arXiv:1802.07975v1 fatcat:y47qm2jajnfp3pgpvu33snrhsa

A Credential-Based Data Path Architecture for Assurable Global Networking

Tilman Wolf
2007 MILCOM 2007 - IEEE Military Communications Conference  
We present a credentials design that is based on Bloom filters and can achieve the desired properties to provide data path assurance.  ...  The main limitation for achieving information assurance in current data networks lies in absence of security considerations in the original Internet architecture.  ...  Bloom-Filter-Based Signatures To meet the above requirements, we introduce a data structure that is based on Bloom filters.  ... 
doi:10.1109/milcom.2007.4454937 fatcat:csqomfzcljdqrn4hvyczg52y5y

Privacy-by-Design(PbD) IoT Framework : A Case of Location Privacy Mitigation Strategies for Near Field Communication (NFC) Tag Sensor

V.Ragunatha Nadarajah, Manmeet Mahinderjit Singh
2017 Advances in Science, Technology and Engineering Systems  
As solution based on tag filtering techniques, existing NFC filtering, Intent filtering has merged together with Bloom filtering from RFID technology.  ...  While the default Intent filtering direct the user to the selected invocation as registered on the tag after the Bloom filtering verification.  ...  For public-key cryptosystems, we could go for Rivest-Shamir-Adleman (RSA) cryptographic for secure data transmission.  Filtering technique -Bloom filtering technique has been merged together with Intent  ... 
doi:10.25046/aj020116 fatcat:w62ga7wrmvatvniwz5jimmiqmi

Access control in decentralized online social networks: Applying a policy-hiding cryptographic scheme and evaluating its performance

Oleksandr Bodriagov, Gunnar Kreitz, Sonja Buchegger
2014 2014 IEEE International Conference on Pervasive Computing and Communication Workshops (PERCOM WORKSHOPS)  
We utilize Bloom filters as a means of decreasing decryption time and indicate objects that can be decrypted by a particular user.  ...  This is usually done by cryptographic means. Existing DOSNs use cryptographic primitives that hide the data but reveal the access policies.  ...  Bloom filter The storage overhead imposed by Bloom filters should be as small as possible.  ... 
doi:10.1109/percomw.2014.6815278 dblp:conf/percom/BodriagovKB14 fatcat:zxjlktte45gvxgzclna2mvoxma
« Previous Showing results 1 — 15 out of 2,173 results