GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2022
    In:  IEEE Transactions on Parallel and Distributed Systems Vol. 33, No. 12 ( 2022-12-1), p. 4612-4624
    In: IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers (IEEE), Vol. 33, No. 12 ( 2022-12-1), p. 4612-4624
    Type of Medium: Online Resource
    ISSN: 1045-9219 , 1558-2183 , 2161-9883
    RVK:
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2022
    detail.hit.zdb_id: 2027774-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2022
    In:  IEEE Transactions on Multimedia Vol. 24 ( 2022), p. 4314-4327
    In: IEEE Transactions on Multimedia, Institute of Electrical and Electronics Engineers (IEEE), Vol. 24 ( 2022), p. 4314-4327
    Type of Medium: Online Resource
    ISSN: 1520-9210 , 1941-0077
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2022
    detail.hit.zdb_id: 2033070-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2023
    In:  The Computer Journal ( 2023-04-05)
    In: The Computer Journal, Oxford University Press (OUP), ( 2023-04-05)
    Abstract: Off-chain payment channel network is an effective solution to deal with low throughput and high load on the blockchain. However, the quality of the routing scheme will directly affect the performance of the off-chain network system. Existing routing schemes cannot select an appropriate transaction path according to the actual needs of user nodes. And they may also lead to network congestion, channel imbalance and node centralization. This paper proposes a new balanced routing selection scheme based on weight calculation called BRBW, which builds a weight model by Analytic Hierarchy Process. BRBW comprehensively considers the channel capacity, handling fee and path length to improve transaction success rate, reduce channel congestion and maintain the long-term sustainability of the payment channel. It uses a modified maximum flow algorithm to find paths with sufficient capacity and selects the transaction path for a large payment through linear programming. Finally, we do some experiments and compare with state-of-the-art approaches in the test environment. Simulation results show that under the same network environment, the payment success rate of the BRBW is above 75%, and the channel utilization rate is about 10% higher than other schemes.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2023
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2019
    In:  The Computer Journal Vol. 62, No. 12 ( 2019-12-10), p. 1761-1776
    In: The Computer Journal, Oxford University Press (OUP), Vol. 62, No. 12 ( 2019-12-10), p. 1761-1776
    Abstract: Kiasu-BC and Joltik-BC are internal tweakable block ciphers of authenticated encryption algorithms Kiasu and Joltik submitted to the CAESAR competition. Kiasu-BC is a 128-bit block cipher, of which tweak and key sizes are 64 and 128 bits, respectively. Joltik-BC-128 is a 64-bit lightweight block cipher supporting 128 bits tweakey. Its designers recommended the key and tweak sizes are both 64 bits. In this paper, we propose improved meet-in-the-middle attacks on 8-round Kiasu-BC, 9-round and 10-round Joltik-BC-128 by exploiting properties of their structures and using precomputation tables and the differential enumeration. For Kiasu-BC, we build a 5-round distinguisher to attack 8-round Kiasu-BC with $2^{109}$ plaintext–tweaks, $2^{112.8}$ encrytions and $2^{92.91}$ blocks. Compared with previously best known cryptanalytic results on 8-round Kiasu-BC under chosen plaintext attacks, the data and time complexities are reduced by $2^{7}$ and $2^{3.2}$ times, respectively. For the recommended version of Joltik-BC-128, we construct a 6-round distinguisher to attack 9-round Joltik-BC-128 with $2^{53}$ plaintext–tweaks, $2^{56.6}$ encryptions and $2^{52.91}$ blocks, respectively. Compared with previously best known results, the data and time complexities are reduced by $2^7$ and $2^{5.1}$ times, respectively. In addition, we present a 6.5-round distinguisher to attack 10-round Joltik-BC-128 with $2^{53}$ plaintext–tweaks, $2^{101.4}$ encryptions and $2^{76.91}$ blocks.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2019
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2022
    In:  IEEE Transactions on Multimedia
    In: IEEE Transactions on Multimedia, Institute of Electrical and Electronics Engineers (IEEE)
    Type of Medium: Online Resource
    ISSN: 1520-9210 , 1941-0077
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2022
    detail.hit.zdb_id: 2033070-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Oxford University Press (OUP) ; 2020
    In:  The Computer Journal Vol. 63, No. 12 ( 2020-12-17), p. 1859-1870
    In: The Computer Journal, Oxford University Press (OUP), Vol. 63, No. 12 ( 2020-12-17), p. 1859-1870
    Abstract: In ASIACRYPT 2014, Jean et al. proposed the authentication encryption scheme Deoxys, which is one of the third-round candidates in CAESAR competition. Its internal block cipher is called Deoxys-BC that adopts the tweakey frame. Deoxys-BC has two versions of the tweakey size that are 256 bits and 384 bits, denoted by Deoxys-BC-256 and Deoxys-BC-384, respectively. In this paper, we revaluate the security of Deoxys-BC-256 against the meet-in-the-middle attack to obtain some new results. First, we append one round at the top and two rounds at the bottom of a 6-round distinguisher to form a 9-round truncated differential path with the probability of $2^{-144}$. Based on it, the adversary can attack 9-round Deoxys-BC-256 with $2^{108}$ chosen plaintext-tweaks, $2^{113.6}$ encryptions and $2^{102}$ blocks. Second, we construct a new 6.5-round distinguisher to form 10-round attacking path with the probability of $2^{-152}$. On the basis of it, the adversary could attack 10-round Deoxys-BC-256 with $2^{115}$ chosen plaintext-tweaks, $2^{171}$ encryptions and $2^{152}$ blocks. These two attacks improve the previous cryptanalytic results on reduced-round Deoxys-BC-256 against the meet-in-the-middle attack.
    Type of Medium: Online Resource
    ISSN: 0010-4620 , 1460-2067
    RVK:
    RVK:
    Language: English
    Publisher: Oxford University Press (OUP)
    Publication Date: 2020
    detail.hit.zdb_id: 1477172-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2023
    In:  ACM Transactions on Multimedia Computing, Communications, and Applications Vol. 19, No. 2 ( 2023-03-31), p. 1-18
    In: ACM Transactions on Multimedia Computing, Communications, and Applications, Association for Computing Machinery (ACM), Vol. 19, No. 2 ( 2023-03-31), p. 1-18
    Abstract: Image-based 3D model retrieval aims at organizing unlabeled 3D models according to the relevance to the labeled 2D images. With easy accessibility of 2D images and wide applications of 3D models, image-based 3D model retrieval attracts more and more attentions. However, it is still a challenging problem due to the modality gap between 2D images and 3D models. In spite of the remarkable progress brought by domain adaptation techniques for this research topic, which usually propose to align the global distribution statistics of two domains, these methods are limited in learning discriminative features for target samples due to the lack of label information in target domain. In this article, besides utilizing the label information of 2D image domain and the adversarial domain alignment, we additionally incorporate self-supervision to address cross-domain 3D model retrieval problem. Specifically, we simultaneously optimize the adversarial adaptation for both domains based on visual features and the contrastive learning for unlabeled 3D model domain to help the feature extractor to learn discriminative feature representations. The contrastive learning is used to map view representations of the identical model nearby while view representations of different models far apart. To guarantee adequate and high-quality negative samples for contrastive learning, we design a memory bank to store and update representative view for each 3D model based on entropy minimization principle. Comprehensive experimental results on the public image-based 3D model retrieval datasets, i.e., MI3DOR and MI3DOR-2, have demonstrated the effectiveness of the proposed method.
    Type of Medium: Online Resource
    ISSN: 1551-6857 , 1551-6865
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2023
    detail.hit.zdb_id: 2182650-X
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2021
    In:  IEEE Transactions on Multimedia Vol. 23 ( 2021), p. 3441-3453
    In: IEEE Transactions on Multimedia, Institute of Electrical and Electronics Engineers (IEEE), Vol. 23 ( 2021), p. 3441-3453
    Type of Medium: Online Resource
    ISSN: 1520-9210 , 1941-0077
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2021
    detail.hit.zdb_id: 2033070-4
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Institute of Electrical and Electronics Engineers (IEEE) ; 2022
    In:  IEEE Transactions on Computers Vol. 71, No. 4 ( 2022-4-1), p. 892-905
    In: IEEE Transactions on Computers, Institute of Electrical and Electronics Engineers (IEEE), Vol. 71, No. 4 ( 2022-4-1), p. 892-905
    Type of Medium: Online Resource
    ISSN: 0018-9340 , 1557-9956 , 2326-3814
    RVK:
    RVK:
    Language: Unknown
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Publication Date: 2022
    detail.hit.zdb_id: 1473005-4
    detail.hit.zdb_id: 218504-0
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...