Revelation on demand

Anciaux, Nicolas; Benzine, Mehdi; Bouganim, Luc; Pelletier, Philippe; Shasha, Dennis

doi:10.1007/s10619-009-7035-x

Cited by 3 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parameters for security evaluation are shown in Table 4. they are separated into system and user revelation respectively [30]. There are certain ways in which the user of a system might reveal his/her authentication key.…”

Section: Rq3mentioning

confidence: 99%

Usability and Security in User Interface Design: A Systematic Literature Review

Nwokedi¹,

Onyimbo²,

Rad³

2016

IJITCS

View full text Add to dashboard Cite

Abstract-Systems carry sensitive data where users are involved. There is need for security concern for the modern software applications. We can term them as 'untrusted clients'. Internet usage has rapidly grown over the years and, more users are opening their information system to their clientele, it is essential to understand users' data that need protecting and to control system access as well and the rights of users of the system. Because of today's increasingly nomadic lifestyle, where they allow users to connect to information systems from anywhere with all the devices in the market, the users need to carry part of the information system out of the secure infrastructure. Insecurity in user interfaces is caused by user ignoring functionalities in the system where some are not only a threat but can harm the system e.g. leaving network services active even though the user does not need them, or when a user is having little or no information of the available security measures. This research paper aims critically address through a review of existing literature, the importance of balance or trade-off between usability and the security of the system. Systematic review method involved a physical exploration of some conference proceedings and journals to conduct the literature review. Research questions relating to usability and security were asked and the criteria for usability and security evaluations were identified. This systematic literature review is valuable in closing the gap between usability and security in software development process, where usability and security engineering needs to be considered for a better quality end-user software.

show abstract

Section: Rq3mentioning

confidence: 99%

Usability and Security in User Interface Design: A Systematic Literature Review

Nwokedi¹,

Onyimbo²,

Rad³

2016

IJITCS

View full text Add to dashboard Cite

show abstract

“…However, with scarce RAM, FTL cannot hide NAND Flash constraints without large performance degradation. 5 Typically, random writes are two or three orders of magnitude more costly than sequential writes on SD cards. 6 In addition, FTL are black box firmwares with behaviors difficult to predict and optimize.…”

Section: Massive Indexing Schemesmentioning

confidence: 99%

“…Let us first consider Select/Project/Join queries (SPJ). The very small ratio between RAM and database size leads to use generalized selection and join indexes [5,28,32,34]. These indexes are called generalized in the sense that they capture the transitive relationships which may exist between tuples of different tables.…”

Section: Which Indexes?mentioning

confidence: 99%

“…More generally, to allow an efficient computation of all SPJ queries with a tiny RAM, we consider a massive indexing scheme in the same line as [5,28,32,34]. This scheme is composed by (1) a TJoin index for each (T i , T j ) such that T i references T j 10 and (2) a TSelect index for each attribute potentially involved in selection predicates and for each (…”

Section: Which Indexes?mentioning

confidence: 99%

See 1 more Smart Citation

MILo-DB: a personal, secure and portable database machine

Anciaux

Bouganim

Pelletier

et al. 2013

Distrib Parallel Databases

Self Cite

View full text Add to dashboard Cite

Mass-storage secure portable tokens are emerging and provide a real breakthrough in the management of sensitive data. They can embed personal data and/or metadata referencing documents stored encrypted in the Cloud and can manage them under holder's control. Mass on-board storage requires efficient embedded database techniques. These techniques are however very challenging to design due to a combination of conflicting NAND Flash constraints and scarce RAM constraint, disqualifying known state of the art solutions. To tackle this challenge, we proposes a log-only based storage organization and an appropriate indexing scheme, which (1) produce only sequential writes compatible with the Flash constraints and (2) consume a tiny amount of RAM, independent of the database size. We show the effectiveness of this approach through a comprehensive performance study.

show abstract

“…Peer-to-peer applications use Bloom filters to represent peer contents, to enable query routing in unstructured P2P networks [9][10][11][12], and for estimating item novelty [13]. In addition, Bloom filters are used for optimizing collaboration protocols, such as collaborative caching [14] and content reconciliation [15], as well as for query optimization in databases with confidential data, to enable join execution without revealing information [16]. In general, the compactness of Bloom filter representations and the constant cost for membership tests is appealing for a wide range of data-intensive distributed systems.…”

mentioning

confidence: 99%

Cardinality estimation and dynamic length adaptation for Bloom filters

Papapetrou

Siberski

Nejdl

2010

Distrib Parallel Databases

View full text Add to dashboard Cite

Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and to increase performance. In this work, we propose two novel Bloom filter features that are important for distributed databases and information systems. First, we present a new approach to encode a Bloom filter such that its length can be adapted to the cardinality of the set it represents, with negligible overhead with respect to computation and false positive probability. The proposed encoding allows for significant network savings in distributed databases, as it enables the participating nodes to optimize the length of each Bloom filter before sending it over the network, for example, when executing Bloom joins. Second, we show how to estimate the number of distinct elements in a Bloom filter, for situations where the represented set is not materialized. These situations frequently arise in distributed databases, where estimating the cardinality of the represented sets is necessary for constructing an efficient query plan. The estimation is highly accurate and comes with tight probabilistic bounds. For both features we provide a thorough probabilistic analysis and extensive experimental evaluation which confirm the effectiveness of our approaches.Note: This is a preprint. The final version is available at http://www.springerlink. com/

show abstract

Revelation on demand

Cited by 3 publications

References 23 publications

Usability and Security in User Interface Design: A Systematic Literature Review

Usability and Security in User Interface Design: A Systematic Literature Review

MILo-DB: a personal, secure and portable database machine

Cardinality estimation and dynamic length adaptation for Bloom filters

Contact Info

Product

Resources

About