Loading...
Search for: indistinguishability
0.005 seconds

    Mid-defense: Mitigating protocol-level attacks in TOR using indistinguishability obfuscation

    , Article 2014 11th International ISC Conference on Information Security and Cryptology, ISCISC 2014 ; 3- 4 September , 2014 , pp. 214-219 ; ISBN: 9781479953837 Soltani, M ; Najafi, S ; Jalili, R ; Sharif University of Technology
    Abstract
    TOR is one of the most famous anonymity networks. TOR works correctly when at least one honest relay exists along an established circuit. However, many attacks reveal anonymity of TOR communications by watermarking traffics, changing timings, counting cells per packets, and recently, introducing errors in cells. This paper focuses on protocol-level attacks which can de-anonymize users by changing a cell, and provides a solution for this attack by changing the way integrities of cells are checked. The proposed design allows all relays, not just the exit node, to check the integrity of cells, independently. In addition, this paper proposes a novel method, based on the concept of... 

    Comparison based semantic security is probabilistic polynomial time equivalent to indistinguishability

    , Article International Journal of Network Security ; Volume 6, Issue 3 , May , 2008 , Pages 354-360 ; 1816353X (ISSN) Bagherzandi, A ; Mohajeri, J ; Salmasizadeh, M ; Sharif University of Technology
    2008
    Abstract
    In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and non-malleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against different attack models and makes the proof of the equivalence of semantic security and indistinguishability easier and more understandable. Besides, our proof of the equivalence of semantic security and indistinguishability does not need any intermediate goals such as non devidability to change the definition framework  

    Security of multi-adjustable join schemes: separations and implications

    , Article IEEE Transactions on Dependable and Secure Computing ; 2021 ; 15455971 (ISSN) Rafiee, M ; Khazaei, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2021
    Abstract
    Database management systems (DBMS) are one of cloud services with major applications in industry and business. In the use of such services, since the cloud service provider cannot be entrusted with the plain data, the databases are typically encrypted prior to outsourcing. One of the most challenging issues in designing these services is supporting SQL join queries on the encrypted database. The multi-adjustable join scheme (M-Adjoin) [Khazaei-Rafiee 2020], an extension of Adjoin [Popa-Zeldovich 2012 and Mironov-Segev-Shahaf 2017], is a symmetric-key primitive that supports the join queries for a list of column labels on an encrypted database. In previous works, the following security... 

    Security of multi-adjustable join schemes: separations and implications

    , Article IEEE Transactions on Dependable and Secure Computing ; Volume 19, Issue 4 , 2022 , Pages 2535-2545 ; 15455971 (ISSN) Rafiee, M ; Khazaei, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2022
    Abstract
    Database management systems (DBMS) are one of cloud services with major applications in industry and business. In the use of such services, since the cloud service provider cannot be entrusted with the plain data, the databases are typically encrypted prior to outsourcing. One of the most challenging issues in designing these services is supporting SQL join queries on the encrypted database. The multi-adjustable join scheme (M-Adjoin) [Khazaei-Rafiee 2020], an extension of Adjoin [Popa-Zeldovich 2012 and Mironov-Segev-Shahaf 2017], is a symmetric-key primitive that supports the join queries for a list of column labels on an encrypted database. In previous works, the following security...