Sciweavers

    DAGSTUHL
    2007
    83views Software Engineering» more  DAGSTUHL 2007»
    Component Based Electronic Voting Systems
    13 years 9 months ago
    Component Based Electronic Voting Systems
    Download  research.microsoft.com
    —An electronic voting system may be said to be composed by a number of components, each of which has a number of properties. One of the most attractive effects of this way of thi...
    David Lundin
    claim paper
    Read More »
    DAGSTUHL
    2007
    114views Software Engineering» more  DAGSTUHL 2007»
    CodeVoting: protecting against malicious vote manipulation at the voter's PC
    13 years 9 months ago
    CodeVoting: protecting against malicious vote manipulation at the voter's PC
    Download  drops.dagstuhl.de
    Voting in uncontrolled environments, such as the Internet comes with a price, the price of having to trust in uncontrolled machines the collection of voter’s vote. An uncontrolle...
    Rui Joaquim, Carlos Ribeiro
    claim paper
    Read More »
    DAGSTUHL
    2007
    96views Software Engineering» more  DAGSTUHL 2007»
    07411 Abstracts Collection -- Algebraic Methods in Computational Complexity
    13 years 9 months ago
    07411 Abstracts Collection -- Algebraic Methods in Computational Complexity
    Download  drops.dagstuhl.de
    Manindra Agrawal, Harry Buhrman, Lance Fortnow, Th...
    claim paper
    Read More »
    DAGSTUHL
    2007
    113views Software Engineering» more  DAGSTUHL 2007»
    Civitas: A Secure Remote Voting System
    13 years 9 months ago
    Civitas: A Secure Remote Voting System
    Download  drops.dagstuhl.de
    Civitas is the first implementation of a coercion-resistant, universally verifiable, remote voting scheme. This paper describes the design of Civitas, details the cryptographic ...
    Michael E. Clarkson, Stephen Chong, Andrew C. Myer...
    claim paper
    Read More »
    DAGSTUHL
    2007
    114views Software Engineering» more  DAGSTUHL 2007»
    Uniqueness of Optimal Mod 3 Circuits for Parity
    13 years 9 months ago
    Uniqueness of Optimal Mod 3 Circuits for Parity
    Download  drops.dagstuhl.de
    In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
    Frederic Green, Amitabha Roy
    claim paper
    Read More »
    DAGSTUHL
    2007
    113views Software Engineering» more  DAGSTUHL 2007»
    Weighted Voronoi Region Algorithms for Political Districting
    13 years 9 months ago
    Weighted Voronoi Region Algorithms for Political Districting
    Download  drops.dagstuhl.de
    Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
    Bruno Simeone, Federica Ricca, Andrea Scozzari
    claim paper
    Read More »
    DAGSTUHL
    2007
    91views Software Engineering» more  DAGSTUHL 2007»
    07311 Abstracts Collection -- Frontiers of Electronic Voting
    13 years 9 months ago
    07311 Abstracts Collection -- Frontiers of Electronic Voting
    Download  drops.dagstuhl.de
    David Chaum, Miroslaw Kutylowski, Ronald L. Rivest...
    claim paper
    Read More »
    DAGSTUHL
    2007
    66views Software Engineering» more  DAGSTUHL 2007»
    A practical and secure coercion-resistant scheme for remote elections
    13 years 9 months ago
    A practical and secure coercion-resistant scheme for remote elections
    Download  drops.dagstuhl.de
    Roberto Araujo, Sébastien Foulle, Jacques T...
    claim paper
    Read More »
    DAGSTUHL
    2007
    93views Software Engineering» more  DAGSTUHL 2007»
    The Unique Games Conjecture with Entangled Provers is False
    13 years 9 months ago
    The Unique Games Conjecture with Entangled Provers is False
    Download  www.cs.tau.ac.il
    We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
    Julia Kempe, Oded Regev, Ben Toner
    claim paper
    Read More »
    DAGSTUHL
    2007
    125views Software Engineering» more  DAGSTUHL 2007»
    Classical Simulation Complexity of Quantum Branching Programs
    13 years 9 months ago
    Classical Simulation Complexity of Quantum Branching Programs
    Download  drops.dagstuhl.de
    We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function w...
    Farid M. Ablayev
    claim paper
    Read More »
    « first‹ previous…318319320321322323324325326…next ›last »
    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-2024, USA.