Sciweavers

    DAGSTUHL
    2007
    113views Software Engineering» more  DAGSTUHL 2007»
    Weighted Voronoi Region Algorithms for Political Districting
    13 years 7 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 7 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 7 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 7 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 7 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 »
    DAGSTUHL
    2007
    109views Software Engineering» more  DAGSTUHL 2007»
    Diagonal Circuit Identity Testing and Lower Bounds
    13 years 7 months ago
    Diagonal Circuit Identity Testing and Lower Bounds
    Download  www.math.uni-bonn.de
    In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
    Nitin Saxena
    claim paper
    Read More »
    DAGSTUHL
    2007
    93views Software Engineering» more  DAGSTUHL 2007»
    An Information-Theoretic Model of Voting Systems
    13 years 7 months ago
    An Information-Theoretic Model of Voting Systems
    Download  www.seas.gwu.edu
    This paper presents an information-theoretic model of a voting system, consisting of (a) definitions of the desirable qualities of integrity, privacy and verifiability, and (b) ...
    Benjamin Hosp, Poorvi L. Vora
    claim paper
    Read More »
    DAGSTUHL
    2007
    105views Software Engineering» more  DAGSTUHL 2007»
    How Fast can be Algebraic Attacks on Block Ciphers?
    13 years 7 months ago
    How Fast can be Algebraic Attacks on Block Ciphers?
    Download  eprint.iacr.org
    In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
    Nicolas Courtois
    claim paper
    Read More »
    DAGSTUHL
    2007
    71views Software Engineering» more  DAGSTUHL 2007»
    Why IV Setup for Stream Ciphers is Difficult
    13 years 7 months ago
    Why IV Setup for Stream Ciphers is Difficult
    Download  www.erikzenner.name
    Erik Zenner
    claim paper
    Read More »
    DAGSTUHL
    2007
    179views Software Engineering» more  DAGSTUHL 2007»
    A Collision-Resistant Rate-1 Double-Block-Length Hash Function
    13 years 7 months ago
    A Collision-Resistant Rate-1 Double-Block-Length Hash Function
    Download  drops.dagstuhl.de
    This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...
    Stefan Lucks
    claim paper
    Read More »
    « first‹ previous…515253545556575859…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.