Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Anton Mityagin"'
Publikováno v:
ACM SIGCOMM Computer Communication Review. 37:29-38
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (BGP) using an efficient alternative to ordinary digital signatures, cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::526cdcbcbd45738b0cdcc1169fffb1f4
https://doi.org/10.1145/1232919.1232923
https://doi.org/10.1145/1232919.1232923
Autor:
Anton Mityagin
Publikováno v:
Theoretical Computer Science. 310(1-3):355-363
We study how many values of an unknown integer-valued function f one needs to know in order to find a local maximum of f. We consider functions defined on finite subsets of discrete plane. We prove upper bounds for functions defined on rectangles and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bacafc9a42087855c23b754d5c76d284
Publikováno v:
SIGIR
This paper studies quality of human labels used to train search engines' rankers. Our specific focus is performance improvements obtained by using overlapping relevance labels, which is by collecting multiple human judgments for each training sample.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::16fef78c169385c2346991f6f7026ad3
https://doi.org/10.1145/1835449.1835526
https://doi.org/10.1145/1835449.1835526
Publikováno v:
KDD Workshop on Human Computation
We demonstrate a system designed to elicit relative relevance judgments from users to rank images with respect to an image query. The system has been deployed and in use publicly for approximately one year. Furthermore, preference data collected from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b6a63642057557ca50c95823ead27cd
https://doi.org/10.1145/1600150.1600157
https://doi.org/10.1145/1600150.1600157
Publikováno v:
WWW
We consider the problem of identifying the consensus ranking for the results of a query, given preferences among those results from a set of individual users. Once consensus rankings are identified for a set of queries, these rankings can serve for b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbf2e7ada2a48a6775b0b94988d6868c
https://doi.org/10.1145/1526709.1526727
https://doi.org/10.1145/1526709.1526727
Publikováno v:
CHI Extended Abstracts
Knowing the intent of a search query allows for more intelligent ways of retrieving relevant search results. Most of the recent work on automatic detection of query intent uses supervised learning methods that require a substantial amount of labeled
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b18fe2ae7d7f180e35f59a77bf3b9696
https://doi.org/10.1145/1520340.1520575
https://doi.org/10.1145/1520340.1520575
Publikováno v:
Provable Security ISBN: 9783540756699
ProvSec
ProvSec
Recent work by Krawczyk [12] and Menezes [16] has highlighted the importance of understanding well the guarantees and limitations of formal security models when using them to prove the security of protocols. In this paper we focus on security models
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39e5368adc8e80a552bb23106fd14c67
https://doi.org/10.1007/978-3-540-75670-5_1
https://doi.org/10.1007/978-3-540-75670-5_1
Publikováno v:
WWW
A minimal perfect function maps a static set of n keys on to the range of integers {0,1,2,...,n - 1}. We present a scalable high performance algorithm based on random graphs for constructing minimal perfect hash functions (MPHFs). For a set of n keys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cce06ee897ebcba721ffc778564a377
https://doi.org/10.1145/1242572.1242747
https://doi.org/10.1145/1242572.1242747
Autor:
Anton Mityagin, Kristin E. Lauter
Publikováno v:
Public Key Cryptography-PKC 2006 ISBN: 9783540338512
Public Key Cryptography
Public Key Cryptography
KEA is a Diffie-Hellman based key-exchange protocol developed by NSA which provides mutual authentication for the parties. It became publicly available in 1998 and since then it was neither attacked nor proved to be secure. We analyze the security of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cde1884de6a59fc336fc0a5ea1e906b9
https://doi.org/10.1007/11745853_25
https://doi.org/10.1007/11745853_25
Autor:
Anton Mityagin, Jan Camenisch
Publikováno v:
Privacy Enhancing Technologies ISBN: 9783540347453
Privacy Enhancing Technologies
Privacy Enhancing Technologies
We consider a mix-network as a cryptographic primitive that provides anonymity. A mix-network takes as input a number of ciphertexts and outputs a random shuffle of the corresponding plaintexts. Common applications of mix-nets are electronic voting a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef6c7efc27bf00ba9d7eaf32ad64e864
https://doi.org/10.1007/11767831_9
https://doi.org/10.1007/11767831_9