Sciweavers

    3134 search results - page 11 / 627
    » Computing full disjunctions
    Sort
    View
    97
    Voted
    AFRICACRYPT
    2010
    Springer
    196views Cryptology» more  AFRICACRYPT 2010»
    Avoiding Full Extension Field Arithmetic in Pairing Computations
    15 years 6 months ago
    Avoiding Full Extension Field Arithmetic in Pairing Computations
    Download  eprint.iacr.org
    Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...
    Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
    claim paper
    Read More »
    114
    Voted
    SIAMCOMP
    1998
    96views more  SIAMCOMP 1998»
    Fault-Tolerant Computation in the Full Information Model
    14 years 11 months ago
    Fault-Tolerant Computation in the Full Information Model
    Download  www.cs.huji.ac.il
    We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
    Oded Goldreich, Shafi Goldwasser, Nathan Linial
    claim paper
    Read More »
    150
    Voted
    CMS
    2011
    229views Communications» more  CMS 2011»
    Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
    13 years 11 months ago
    Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version)
    Download  thomaschneider.de
    Abstract. Cloud computing promises a cost effective enabling technology to outsource storage and massively parallel computations. However, existing approaches for provably secure ...
    Sven Bugiel, Stefan Nürnberger, Ahmad-Reza Sa...
    claim paper
    Read More »
    FOCS
    2006
    IEEE
    122views Theoretical Computer Science» more  FOCS 2006»
    Fault-Tolerant Distributed Computing in Full-Information Networks
    15 years 5 months ago
    Fault-Tolerant Distributed Computing in Full-Information Networks
    Download  people.csail.mit.edu
    In this paper, we use random-selection protocols in the full-information model to solve classical problems in distributed computing. Our main results are the following: • An O(l...
    Shafi Goldwasser, Elan Pavlov, Vinod Vaikuntanatha...
    claim paper
    Read More »
    ECCC
    2011
    223views ECommerce» more  ECCC 2011»
    A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
    14 years 6 months ago
    A Full Proof of the BGW Protocol for Perfectly-Secure Multiparty Computation
    Download  eprint.iacr.org
    Gilad Asharov, Yehuda Lindell
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2025, USA.