Sciweavers

    6164 search results - page 76 / 1233
    » Teaching Computer Security
    Sort
    View
    SCN
    2008
    Springer
    142views Communications» more  SCN 2008»
    Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
    15 years 6 months ago
    Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
    Download  u.cs.biu.ac.il
    We present an implementation of the protocol of Lindell and Pinkas for secure two-party computation which is secure against malicious adversaries [13]. This is the first running sy...
    Yehuda Lindell, Benny Pinkas, Nigel P. Smart
    claim paper
    Read More »
    ISI
    2006
    Springer
    108views Security Privacy» more  ISI 2006»
    A Trust-Based Security Architecture for Ubiquitous Computing Systems
    15 years 6 months ago
    A Trust-Based Security Architecture for Ubiquitous Computing Systems
    Download  uclab.khu.ac.kr
    Hung Le Xuan, Pho Duc Giang, Yonil Zhung, Tran Van...
    claim paper
    Read More »
    PROVSEC
    2009
    Springer
    109views Security Privacy» more  PROVSEC 2009»
    GUC-Secure Set-Intersection Computation
    16 years 21 days ago
    GUC-Secure Set-Intersection Computation
    Download  eprint.iacr.org
    Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
    Yuan Tian, Hao Zhang
    claim paper
    Read More »
    MOC
    2010
    117views Security Privacy» more  MOC 2010»
    Computing a lower bound for the canonical height on elliptic curves over number fields
    15 years 28 days ago
    Computing a lower bound for the canonical height on elliptic curves over number fields
    Download  home.kku.ac.th
    Computing a lower bound for the canonical height is a crucial step in determining a Mordell
    Thotsaphon Thongjunthug
    claim paper
    Read More »
    CCS
    2008
    ACM
    104views Security Privacy» more  CCS 2008»
    Computationally sound mechanized proofs for basic and public-key Kerberos
    15 years 8 months ago
    Computationally sound mechanized proofs for basic and public-key Kerberos
    Download  www.math.upenn.edu
    Bruno Blanchet, Aaron D. Jaggard, Andre Scedrov, J...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.