Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Brian A. Lamacchia"'
Publikováno v:
Communications of the ACM. 41:74-83
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4bff5809b19e9a319a82225e7e69f915
https://doi.org/10.1145/280324.280336
https://doi.org/10.1145/280324.280336
Publikováno v:
Computer Networks and ISDN Systems. 29:953-964
Digital signatures provide a mechanism for guaranteeing integrity and authenticity of Web content but not more general notions of security or trust. Web-aware applications must permit users to state clearly their own security policies and, of course,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bfa0ae2267802b0be6762ba68fcf06d
https://doi.org/10.1016/s0169-7552(97)00009-3
https://doi.org/10.1016/s0169-7552(97)00009-3
Autor:
Brian A. Lamacchia
Publikováno v:
Computer Networks and ISDN Systems. 29:1237-1248
We describe in this paper the Internet Fish Construction Kit, a tool for building persistent, personal, dynamic information gatherers (“Internet Fish”) [3] for the World-Wide Web. Internet Fish ( IFish ) differ from current resource discovery too
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb7c9e55f00ca5e2cf3215eb3483d483
https://doi.org/10.1016/s0169-7552(97)00023-8
https://doi.org/10.1016/s0169-7552(97)00023-8
Autor:
Barbara Fox, Brian A. Lamacchia
Publikováno v:
Communications of the ACM. 46:61-63
Create subsets of fair uses---safe harbors---that are allowed without the explicit permission of copyright holders.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc4bde7ccba4028bc83779748b37ede2
https://doi.org/10.1145/641205.641233
https://doi.org/10.1145/641205.641233
Autor:
Matthijs J. Coster, Brian A. Lamacchia, Jacques Stern, Antoine Joux, Claus-Peter Schnorr, Andrew Odlyzko
Publikováno v:
Computational Complexity. 2:111-128
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5465d79d922ad8cea3a4e49476e08f6
https://doi.org/10.1007/bf01201999
https://doi.org/10.1007/bf01201999
Autor:
Brian A. Lamacchia, Andrew Odlyzko
Publikováno v:
Designs, Codes and Cryptography. 1:47-62
The presumed difficulty of computing discrete logarithms in finite fields is the basis of several popular public key cryptosystems. The secure identification option of the Sun Network File System, for example, uses discrete logarithms in a field GF(p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a2fbf49fe9f5fe4f91da2ea9113c1f1
https://doi.org/10.1007/bf00123958
https://doi.org/10.1007/bf00123958
Autor:
Brian A. Lamacchia, Andrew Odlyzko
Publikováno v:
Advances in Cryptology-CRYPT0’ 90 ISBN: 9783540545088
CRYPTO
CRYPTO
Many of the fast methods for factoring integers and computing discrete logarithms require the solution of large sparse linear systems of equations over finite fields. This paper presents the results of implementations of several linear algebra algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbae942b15468c699cf01c14d1021e89
https://doi.org/10.1007/3-540-38424-3_8
https://doi.org/10.1007/3-540-38424-3_8
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
Autor:
G. Wasson, Brian A. Lamacchia, Norm Beekwilder, B. Dillaway, Jun Feng, J. Hogg, Marty Humphrey, Sang-Min Park
Publikováno v:
GRID
Grid access control policy languages today are generally one of two extremes: either extremely simplistic, or overly complex and challenging for even security experts to use. In this paper, we explicitly identify requirements for an access control po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::962e0a864ec43579950237c62cc03add
https://doi.org/10.1109/grid.2007.4354136
https://doi.org/10.1109/grid.2007.4354136
Publikováno v:
Advances in Cryptology — EUROCRYPT ’91 ISBN: 9783540546207
EUROCRYPT
EUROCRYPT
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9f4c14c12403f1a1d6b59055b6cb1b3
https://doi.org/10.1007/3-540-46416-6_4
https://doi.org/10.1007/3-540-46416-6_4