We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Computer science

Search Results

Showing 61-80 of 716 results

  1. Introduction to Authentication and Key Establishment

    Authentication and key establishment are fundamental steps in setting up secure communications. Authentication is concerned with knowing that the...
    Colin Boyd, Anish Mathuria, Douglas Stebila in Protocols for Authentication and Key Establishment
    Chapter 2020

  2. Flexible Authenticated and Confidential Channel Establishment (fACCE): Analyzing the Noise Protocol Framework

    The Noise protocol framework is a suite of channel establishment protocols, of which each individual protocol ensures various security properties of...
    Benjamin Dowling, Paul Rösler, Jörg Schwenk in Public-Key Cryptography – PKC 2020
    Conference paper 2020

  3. Hermes: A Language for Light-Weight Encryption

    Hermes is a domain-specific language for writing light-weight encryption algorithms: It is reversible, so it is not necessary to write separate...
    Torben Ægidius Mogensen in Reversible Computation
    Conference paper 2020

  4. Many a Mickle Makes a Muckle: A Framework for Provably Quantum-Secure Hybrid Key Exchange

    Hybrid Authenticated Key Exchange (AKE) protocols combine keying material from different sources (post-quantum, classical, and quantum key...
    Benjamin Dowling, Torben Brandt Hansen, Kenneth G. Paterson in Post-Quantum Cryptography
    Conference paper 2020

  5. Actively Secure Arithmetic Computation and VOLE with Constant Computational Overhead

    We study the complexity of two-party secure arithmetic computation where the goal is to evaluate an arithmetic circuit over a finite field...
    Benny Applebaum, Niv Konstantini in Advances in Cryptology – EUROCRYPT 2023
    Conference paper 2023

  6. ATLAS: Efficient and Scalable MPC in the Honest Majority Setting

    In this work, we address communication, computation, and round efficiency of unconditionally secure multi-party computation for arithmetic circuits...
    Vipul Goyal, Hanjun Li, ... Yifan Song in Advances in Cryptology – CRYPTO 2021
    Conference paper 2021

  7. On Actively-Secure Elementary MPC Reductions

    We introduce the notion of elementary MPC reductions that allow us to securely compute a functionality f by making a single call to a constant-degree...
    Benny Applebaum, Aarushi Goel in Theory of Cryptography
    Conference paper 2021

  8. Synchronization of the Quantum Key Distribution System with Priori Information About the Fiber-Optic Line Length

    The synchronization is explored for the quantum key distribution (QKD), where photon pulses are utilized as synchronized signals. The analyzed...
    Konstantin Rumyantsev, H. H.-Sh. Shakir in Futuristic Trends in Networks and Computing Technologies
    Conference paper 2020

  9. Combining ProVerif and Automated Theorem Provers for Security Protocol Verification

    Symbolic verification of security protocols typically relies on an attacker model called the Dolev-Yao model, which does not model adequately various...
    Di Long Li, Alwen Tiu in Automated Deduction – CADE 27
    Conference paper 2019

  10. QML: Way Forward

    Quantum machine learning (QML) is a cross-disciplinary subject made up of two of the most exciting research areas: quantum computing and classical...
    Santanu Ganguly in Quantum Machine Learning: An Applied Approach
    Chapter 2021

  11. Guaranteed Output Delivery Comes Free in Honest Majority MPC

    We study the communication complexity of unconditionally secure MPC with guaranteed output delivery over point-to-point channels for corruption...
    Vipul Goyal, Yifan Song, Chenzhi Zhu in Advances in Cryptology – CRYPTO 2020
    Conference paper 2020

  12. Efficient Perfectly Secure Computation with Optimal Resilience

    Secure computation enables n mutually distrustful parties to compute a function over their private inputs jointly. In 1988, Ben-Or, Goldwasser, and...

    Ittai Abraham, Gilad Asharov, Avishay Yanai in Journal of Cryptology
    Article 27 September 2022

  13. Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation

    A wiretap coding scheme (Wyner, Bell Syst. Tech. J. 1975) enables Alice to reliably communicate a message m to an honest Bob by sending an encoding c...
    Yuval Ishai, Alexis Korb, ... Amit Sahai in Advances in Cryptology – CRYPTO 2022
    Conference paper 2022

  14. Towards Accountability in CRS Generation

    It is well known that several cryptographic primitives cannot be achieved without a common reference string (CRS). Those include, for instance,...
    Prabhanjan Ananth, Gilad Asharov, ... Vipul Goyal in Advances in Cryptology – EUROCRYPT 2021
    Conference paper 2021

  15. A Cooperative Jamming Based Secure Uplink Transmission Scheme for Heterogeneous Networks Supporting D2D Communications

    A heterogeneous network supporting D2D communications is a typical framework to cope with data sharing in a cyber physical system. In the network,...
    **g**g Fan, Yan Huo, ... Guanlin **g in Wireless Algorithms, Systems, and Applications
    Conference paper 2018

  16. Optimal Security Notion for Decentralized Multi-Client Functional Encryption

    Research on (Decentralized) Multi-Client Functional Encryption (or (D)MCFE) is very active, with interesting constructions, especially for the class...
    Ky Nguyen, Duong Hieu Phan, David Pointcheval in Applied Cryptography and Network Security
    Conference paper 2023

  17. Micro-Hypervisor Applications

    This chapter showcases several micro-hypervisor-based applications (“uberapps”) that employ uberXMHF. These uberapps span a wide spectrum of security...
    Amit Vasudevan in Practical Security Properties on Commodity Computing Platforms
    Chapter 2019

  18. Provably Secure Proactive Secret Sharing Without the Adjacent Assumption

    In secret sharing (SS), the secret is shared among a number of parties so that only a quorum of these parties can recover the secret, but a smaller...
    Zhe **a, Bo Yang, ... Yi Mu in Provable Security
    Conference paper 2019

  19. Efficient Perfectly Secure Computation with Optimal Resilience

    Secure computation enables n mutually distrustful parties to compute a function over their private inputs jointly. In 1988 Ben-Or, Goldwasser, and...
    Ittai Abraham, Gilad Asharov, Avishay Yanai in Theory of Cryptography
    Conference paper 2021

  20. Watermarking techniques for medical data authentication: a survey

    With the widespread growth of medical images and improved communication and computer technologies in recent years, authenticity of the images has...

    Ashima Anand, Amit Kumar Singh in Multimedia Tools and Applications
    Article 13 April 2020
Did you find what you were looking for? Share feedback.