Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Dmitri Asonov"'
Publikováno v:
Forensic Science International: Synergy, Vol 9, Iss , Pp 100547- (2024)
Externí odkaz:
https://doaj.org/article/a154034fd0874077819b5a1a26a33710
Autor:
Dmitri Asonov, Maksim Krylov, Vladimir Omelyusik, Anastasiya Ryabikina, Evgeny Litvinov, Maksim Mitrofanov, Maksim Mikhailov, Albert Efimov
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-14 (2023)
Abstract Classical polygraph screenings are routinely used by critical businesses such as banking, law enforcement agencies, and federal governments. A major concern of scientific communities is that screenings are prone to errors. However, screening
Externí odkaz:
https://doaj.org/article/0237fb0ed02b46bc8795bfa69ed947cc
Autor:
Dmitri Asonov
Publikováno v:
Natural Language Processing and Information Systems ISBN: 9783642125492
NLDB
NLDB
Context-sensitive spelling correction (CSSC) is a widely accepted and long studied formalization of the problem of finding and fixing contextually incorrect words. We argue that CSSC has its limitations as a model, and propose a weakened CSSC model (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21d21d8ad95e76fe34a5a8a567d9d2fe
https://doi.org/10.1007/978-3-642-12550-8_10
https://doi.org/10.1007/978-3-642-12550-8_10
Publikováno v:
22nd International Conference on Data Engineering (ICDE'06).
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send encrypted relations to the service that sends the encrypted results to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7b322c78ec4ad1c2c44ab5a9f976a0d
https://doi.org/10.1109/icde.2006.144
https://doi.org/10.1109/icde.2006.144
Publikováno v:
SIGMOD Conference
Sovereign information sharing allows autonomous entities to compute queries across their databases in such a way that nothing apart from the result is revealed. We describe an implementation of this model using web services infrastructure. Each site
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33c55aa091f85aec2a2a672c88d053eb
https://doi.org/10.1145/1007568.1007673
https://doi.org/10.1145/1007568.1007673
Autor:
Dmitri Asonov
Publikováno v:
Querying Databases Privately ISBN: 9783540224419
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d56696d430c363ca732dacd608f3f7bc
https://doi.org/10.1007/978-3-540-27770-5_1
https://doi.org/10.1007/978-3-540-27770-5_1
Autor:
Dmitri Asonov
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540224419
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::429fa3075184e1915fc83f948691b192
https://doi.org/10.1007/b98671
https://doi.org/10.1007/b98671
Autor:
Dmitri Asonov
Publikováno v:
Querying Databases Privately ISBN: 9783540224419
This chapter considers the problem of providing digital rights management (DRM) for goods sold by means of PIR. Section 7.1 shows that DRM and PIR cannot coexist perfectly. Furthermore, Section 7.2 demonstrates how applying a straightforward DRM sche
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::baf61da254e5dc15be7d23a0e5826362
https://doi.org/10.1007/978-3-540-27770-5_7
https://doi.org/10.1007/978-3-540-27770-5_7
Autor:
Dmitri Asonov
Publikováno v:
Querying Databases Privately ISBN: 9783540224419
The previous chapter proposed a new shuffling algorithm (SSG) and estimated its complexity theoretically. This chapter naturally amplifies the previous chapter with the experimental analysis of the performance of SSG and concurrent approaches (SSA an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbb8d1e53355c61f67f27473db59dcc4
https://doi.org/10.1007/978-3-540-27770-5_5
https://doi.org/10.1007/978-3-540-27770-5_5
Autor:
Dmitri Asonov
Publikováno v:
Querying Databases Privately ISBN: 9783540224419
Section 4.1 tunes the PIR protocol proposed in the previous chapter by reducing its query response time. Section 4.2 tunes the same PIR protocol by reducing shuffling (preprocessing) complexity. This problem appears to be considerably more complex th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c34464efced3d9e8a3c80de303bcb7fd
https://doi.org/10.1007/978-3-540-27770-5_4
https://doi.org/10.1007/978-3-540-27770-5_4