A Modular Voting Architecture (“Frog Voting”)
Identifieur interne : 000414 ( Main/Corpus ); précédent : 000413; suivant : 000415A Modular Voting Architecture (“Frog Voting”)
Auteurs : Shuki Bruck ; David Jefferson ; L. RivestSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2010.
Abstract
Abstract: This paper presents a new framework–a reference architecture–for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to improvement and further research. An early version of this paper appeared in [2]. This version of the paper is very similar, but contains a postscript (Section 8) providing commentary and discussion of perspectives on this proposal generated during the intervening years between 2001 and 2008.
Url:
DOI: 10.1007/978-3-642-12980-3_5
Links to Exploration step
ISTEX:4230CA9B9E60AD16C1DA536B55577CCF7F019FA8Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Modular Voting Architecture (“Frog Voting”)</title><author><name sortKey="Bruck, Shuki" sort="Bruck, Shuki" uniqKey="Bruck S" first="Shuki" last="Bruck">Shuki Bruck</name><affiliation><mods:affiliation>CalTech</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bruck@caltech.edu</mods:affiliation></affiliation></author><author><name sortKey="Jefferson, David" sort="Jefferson, David" uniqKey="Jefferson D" first="David" last="Jefferson">David Jefferson</name><affiliation><mods:affiliation>Lawrence Livermore Laboratory</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: d_jefferson@yahoo.com</mods:affiliation></affiliation></author><author><name sortKey="Rivest, L" sort="Rivest, L" uniqKey="Rivest L" first="L." last="Rivest">L. Rivest</name><affiliation><mods:affiliation>Computer Science and Artificial Intelligence Laboratory, MIT, 02139, Cambridge, MA</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rivest@mit.edu</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:4230CA9B9E60AD16C1DA536B55577CCF7F019FA8</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-12980-3_5</idno><idno type="url">https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/fulltext/pdf</idno><idno type="wicri:Area/Main/Corpus">000414</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Modular Voting Architecture (“Frog Voting”)</title><author><name sortKey="Bruck, Shuki" sort="Bruck, Shuki" uniqKey="Bruck S" first="Shuki" last="Bruck">Shuki Bruck</name><affiliation><mods:affiliation>CalTech</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bruck@caltech.edu</mods:affiliation></affiliation></author><author><name sortKey="Jefferson, David" sort="Jefferson, David" uniqKey="Jefferson D" first="David" last="Jefferson">David Jefferson</name><affiliation><mods:affiliation>Lawrence Livermore Laboratory</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: d_jefferson@yahoo.com</mods:affiliation></affiliation></author><author><name sortKey="Rivest, L" sort="Rivest, L" uniqKey="Rivest L" first="L." last="Rivest">L. Rivest</name><affiliation><mods:affiliation>Computer Science and Artificial Intelligence Laboratory, MIT, 02139, Cambridge, MA</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: rivest@mit.edu</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2010</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">4230CA9B9E60AD16C1DA536B55577CCF7F019FA8</idno><idno type="DOI">10.1007/978-3-642-12980-3_5</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper presents a new framework–a reference architecture–for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to improvement and further research. An early version of this paper appeared in [2]. This version of the paper is very similar, but contains a postscript (Section 8) providing commentary and discussion of perspectives on this proposal generated during the intervening years between 2001 and 2008.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Shuki Bruck</name><affiliations><json:string>CalTech,</json:string><json:string>E-mail: bruck@caltech.edu</json:string></affiliations></json:item><json:item><name>David Jefferson</name><affiliations><json:string>Lawrence Livermore Laboratory,</json:string><json:string>E-mail: d_jefferson@yahoo.com</json:string></affiliations></json:item><json:item><name>Ronald L. Rivest</name><affiliations><json:string>Computer Science and Artificial Intelligence Laboratory, MIT, 02139, Cambridge, MA</json:string><json:string>E-mail: rivest@mit.edu</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract: This paper presents a new framework–a reference architecture–for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to improvement and further research. An early version of this paper appeared in [2]. This version of the paper is very similar, but contains a postscript (Section 8) providing commentary and discussion of perspectives on this proposal generated during the intervening years between 2001 and 2008.</abstract><qualityIndicators><score>6.449</score><pdfVersion>1.6</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>629</abstractCharCount><pdfWordCount>3821</pdfWordCount><pdfCharCount>22439</pdfCharCount><pdfPageCount>10</pdfPageCount><abstractWordCount>94</abstractWordCount></qualityIndicators><title>A Modular Voting Architecture (“Frog Voting”)</title><chapterId><json:string>5</json:string><json:string>Chap5</json:string></chapterId><genre><json:string>research-article</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, Lancaster, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, Stanford, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>University of California, Los Angeles, CA, USA</json:string></affiliations></json:item><json:item><name>Doug Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbrücken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2010</copyrightDate></serie><host><editor><json:item><name>David Chaum</name><affiliations><json:string>Independent researcher,</json:string><json:string>E-mail: david@chaum.com</json:string></affiliations></json:item><json:item><name>Markus Jakobsson</name><affiliations><json:string>Palo Alto Research Center, CA, USA</json:string><json:string>E-mail: markus.jakobsson@gmail.com</json:string></affiliations></json:item><json:item><name>Ronald L. Rivest</name><affiliations><json:string>Massachusetts Institute of Technology, Cambridge, MA, USA</json:string><json:string>E-mail: rivest@mit.edu</json:string></affiliations></json:item><json:item><name>Peter Y. A. Ryan</name><affiliations><json:string>University of Luxembourg, Luxembourg</json:string><json:string>E-mail: peter.ryan@uni.lu</json:string></affiliations></json:item><json:item><name>Josh Benaloh</name><affiliations><json:string>Microsoft Research Center, Redmond, WA, USA</json:string><json:string>E-mail: benaloh@microsoft.com</json:string></affiliations></json:item><json:item><name>Miroslaw Kutylowski</name><affiliations><json:string>Wroclaw University of Technology, Poland</json:string><json:string>E-mail: mirekk@swarog.im.pwr.wroc.pl</json:string></affiliations></json:item><json:item><name>Ben Adida</name><affiliations><json:string>Harvard Center for Research on Computation and Society, Boston, MA, USA</json:string><json:string>E-mail: ben@adida.net</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Data Encryption</value></json:item><json:item><value>Management of Computing and Information Systems</value></json:item><json:item><value>Algorithm Analysis and Problem Complexity</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Computers and Society</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item></subject><isbn><json:string>978-3-642-12979-7</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Towards Trustworthy Elections</title><bookId><json:string>978-3-642-12980-3</json:string></bookId><volume>6000</volume><pages><last>106</last><first>97</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-642-12980-3</json:string></eisbn><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-12980-3</json:string></doi></host><publicationDate>2010</publicationDate><copyrightDate>2010</copyrightDate><doi><json:string>10.1007/978-3-642-12980-3_5</json:string></doi><id>4230CA9B9E60AD16C1DA536B55577CCF7F019FA8</id><score>2.0011501</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A Modular Voting Architecture (“Frog Voting”)</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>IAVOSS/Springer-Verlag Berlin Heidelberg, 2010</p></availability><date>2010</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A Modular Voting Architecture (“Frog Voting”)</title><author xml:id="author-1"><persName><forename type="first">Shuki</forename><surname>Bruck</surname></persName><email>bruck@caltech.edu</email><affiliation>CalTech,</affiliation></author><author xml:id="author-2"><persName><forename type="first">David</forename><surname>Jefferson</surname></persName><email>d_jefferson@yahoo.com</email><affiliation>Lawrence Livermore Laboratory,</affiliation></author><author xml:id="author-3"><persName><forename type="first">Ronald</forename><surname>Rivest</surname></persName><email>rivest@mit.edu</email><affiliation>Computer Science and Artificial Intelligence Laboratory, MIT, 02139, Cambridge, MA</affiliation></author></analytic><monogr><title level="m">Towards Trustworthy Elections</title><title level="m" type="sub">New Directions in Electronic Voting</title><idno type="pISBN">978-3-642-12979-7</idno><idno type="eISBN">978-3-642-12980-3</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/978-3-642-12980-3</idno><idno type="book-ID">978-3-642-12980-3</idno><idno type="book-title-ID">211277</idno><idno type="book-sequence-number">6000</idno><idno type="book-volume-number">6000</idno><idno type="book-chapter-count">24</idno><editor><persName><forename type="first">David</forename><surname>Chaum</surname></persName><email>david@chaum.com</email><affiliation>Independent researcher,</affiliation></editor><editor><persName><forename type="first">Markus</forename><surname>Jakobsson</surname></persName><email>markus.jakobsson@gmail.com</email><affiliation>Palo Alto Research Center, CA, USA</affiliation></editor><editor><persName><forename type="first">Ronald</forename><forename type="first">L.</forename><surname>Rivest</surname></persName><email>rivest@mit.edu</email><affiliation>Massachusetts Institute of Technology, Cambridge, MA, USA</affiliation></editor><editor><persName><forename type="first">Peter</forename><forename type="first">Y.</forename><forename type="first">A.</forename><surname>Ryan</surname></persName><email>peter.ryan@uni.lu</email><affiliation>University of Luxembourg, Luxembourg</affiliation></editor><editor><persName><forename type="first">Josh</forename><surname>Benaloh</surname></persName><email>benaloh@microsoft.com</email><affiliation>Microsoft Research Center, Redmond, WA, USA</affiliation></editor><editor><persName><forename type="first">Miroslaw</forename><surname>Kutylowski</surname></persName><email>mirekk@swarog.im.pwr.wroc.pl</email><affiliation>Wroclaw University of Technology, Poland</affiliation></editor><editor><persName><forename type="first">Ben</forename><surname>Adida</surname></persName><email>ben@adida.net</email><affiliation>Harvard Center for Research on Computation and Society, Boston, MA, USA</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2010"></date><biblScope unit="volume">6000</biblScope><biblScope unit="page" from="97">97</biblScope><biblScope unit="page" to="106">106</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, Lancaster, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, Stanford, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>University of California, Los Angeles, CA, USA</affiliation></editor><editor><persName><forename type="first">Doug</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation></editor><biblScope><date>2010</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">4230CA9B9E60AD16C1DA536B55577CCF7F019FA8</idno><idno type="DOI">10.1007/978-3-642-12980-3_5</idno><idno type="ChapterID">5</idno><idno type="ChapterID">Chap5</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2010</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: This paper presents a new framework–a reference architecture–for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to improvement and further research. An early version of this paper appeared in [2]. This version of the paper is very similar, but contains a postscript (Section 8) providing commentary and discussion of perspectives on this proposal generated during the intervening years between 2001 and 2008.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I15033</label><label>I24067</label><label>I16021</label><label>I13022</label><label>I24040</label><label>I18040</label><item><term>Computer Science</term></item><item><term>Data Encryption</term></item><item><term>Management of Computing and Information Systems</term></item><item><term>Algorithm Analysis and Problem Complexity</term></item><item><term>Computer Communication Networks</term></item><item><term>Computers and Society</term></item><item><term>Information Systems Applications (incl.Internet)</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2010">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-09-22">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo TocLevels="0" SeriesType="Series"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Doug</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><City>Lancaster</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><City>Zurich</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>Stanford</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><City>Bern</City><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><City>Dortmund</City><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>University of California</OrgName><OrgAddress><City>Los Angeles</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo Language="En" NumberingStyle="ContentOnly" NumberingDepth="2" OutputMedium="All" TocLevels="0" ContainsESM="No" BookProductType="Contributed volume" MediaType="eBook"><BookID>978-3-642-12980-3</BookID><BookTitle>Towards Trustworthy Elections</BookTitle><BookSubTitle>New Directions in Electronic Voting</BookSubTitle><BookVolumeNumber>6000</BookVolumeNumber><BookSequenceNumber>6000</BookSequenceNumber><BookDOI>10.1007/978-3-642-12980-3</BookDOI><BookTitleID>211277</BookTitleID><BookPrintISBN>978-3-642-12979-7</BookPrintISBN><BookElectronicISBN>978-3-642-12980-3</BookElectronicISBN><BookChapterCount>24</BookChapterCount><BookCopyright><CopyrightHolderName>IAVOSS/Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Type="Primary" Code="I">Computer Science</BookSubject><BookSubject Type="Secondary" Priority="1" Code="I15033">Data Encryption</BookSubject><BookSubject Type="Secondary" Priority="2" Code="I24067">Management of Computing and Information Systems</BookSubject><BookSubject Type="Secondary" Priority="3" Code="I16021">Algorithm Analysis and Problem Complexity</BookSubject><BookSubject Type="Secondary" Priority="4" Code="I13022">Computer Communication Networks</BookSubject><BookSubject Type="Secondary" Priority="5" Code="I24040">Computers and Society</BookSubject><BookSubject Type="Secondary" Priority="6" Code="I18040">Information Systems Applications (incl.Internet)</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Chaum</FamilyName></EditorName><Contact><Email>david@chaum.com</Email></Contact></Editor><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>Markus</GivenName><FamilyName>Jakobsson</FamilyName></EditorName><Contact><Email>markus.jakobsson@gmail.com</Email></Contact></Editor><Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Ronald</GivenName><GivenName>L.</GivenName><FamilyName>Rivest</FamilyName></EditorName><Contact><Email>rivest@mit.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff19"><EditorName DisplayOrder="Western"><GivenName>Peter</GivenName><GivenName>Y.</GivenName><GivenName>A.</GivenName><FamilyName>Ryan</FamilyName></EditorName><Contact><Email>peter.ryan@uni.lu</Email></Contact></Editor><Editor AffiliationIDS="Aff20"><EditorName DisplayOrder="Western"><GivenName>Josh</GivenName><FamilyName>Benaloh</FamilyName></EditorName><Contact><Email>benaloh@microsoft.com</Email></Contact></Editor><Editor AffiliationIDS="Aff21"><EditorName DisplayOrder="Western"><GivenName>Miroslaw</GivenName><FamilyName>Kutylowski</FamilyName></EditorName><Contact><Email>mirekk@swarog.im.pwr.wroc.pl</Email></Contact></Editor><Editor AffiliationIDS="Aff22"><EditorName DisplayOrder="Western"><GivenName>Ben</GivenName><FamilyName>Adida</FamilyName></EditorName><Contact><Email>ben@adida.net</Email></Contact></Editor><Affiliation ID="Aff16"><OrgName>Independent researcher</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation><Affiliation ID="Aff17"><OrgName>Palo Alto Research Center</OrgName><OrgAddress><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff18"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><City>Cambridge</City><State>MA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff19"><OrgName>University of Luxembourg</OrgName><OrgAddress><Country>Luxembourg</Country></OrgAddress></Affiliation><Affiliation ID="Aff20"><OrgName>Microsoft Research Center</OrgName><OrgAddress><City>Redmond</City><State>WA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff21"><OrgName>Wroclaw University of Technology</OrgName><OrgAddress><Country>Poland</Country></OrgAddress></Affiliation><Affiliation ID="Aff22"><OrgName>Harvard Center for Research on Computation and Society</OrgName><OrgAddress><City>Boston</City><State>MA</State><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap5" Language="En"><ChapterInfo ChapterType="OriginalPaper" NumberingStyle="ContentOnly" NumberingDepth="2" TocLevels="0" ContainsESM="No"><ChapterID>5</ChapterID><ChapterDOI>10.1007/978-3-642-12980-3_5</ChapterDOI><ChapterSequenceNumber>5</ChapterSequenceNumber><ChapterTitle Language="En">A Modular Voting Architecture (“Frog Voting”)</ChapterTitle><ChapterFirstPage>97</ChapterFirstPage><ChapterLastPage>106</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2010</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>978-3-642-12980-3</BookID><BookTitle>Towards Trustworthy Elections</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff23"><AuthorName DisplayOrder="Western"><GivenName>Shuki</GivenName><FamilyName>Bruck</FamilyName></AuthorName><Contact><Email>bruck@caltech.edu</Email></Contact></Author><Author AffiliationIDS="Aff24"><AuthorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Jefferson</FamilyName></AuthorName><Contact><Email>d_jefferson@yahoo.com</Email></Contact></Author><Author AffiliationIDS="Aff25"><AuthorName DisplayOrder="Western"><GivenName>Ronald</GivenName><GivenName>L.</GivenName><FamilyName>Rivest</FamilyName></AuthorName><Contact><Email>rivest@mit.edu</Email></Contact></Author><Affiliation ID="Aff23"><OrgName>CalTech</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation><Affiliation ID="Aff24"><OrgName>Lawrence Livermore Laboratory</OrgName><OrgAddress><Country> </Country></OrgAddress></Affiliation><Affiliation ID="Aff25"><OrgDivision>Computer Science and Artificial Intelligence Laboratory</OrgDivision><OrgName>MIT</OrgName><OrgAddress><City>Cambridge</City><State>MA</State><Postcode>02139</Postcode></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>This paper presents a new framework–a reference architecture–for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to improvement and further research.</Para><Para>An early version of this paper appeared in [2]. This version of the paper is very similar, but contains a postscript (Section 8) providing commentary and discussion of perspectives on this proposal generated during the intervening years between 2001 and 2008.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A Modular Voting Architecture (“Frog Voting”)</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A Modular Voting Architecture (“Frog Voting”)</title></titleInfo><name type="personal"><namePart type="given">Shuki</namePart><namePart type="family">Bruck</namePart><affiliation>CalTech</affiliation><affiliation>E-mail: bruck@caltech.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">David</namePart><namePart type="family">Jefferson</namePart><affiliation>Lawrence Livermore Laboratory</affiliation><affiliation>E-mail: d_jefferson@yahoo.com</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Ronald</namePart><namePart type="given">L.</namePart><namePart type="family">Rivest</namePart><affiliation>Computer Science and Artificial Intelligence Laboratory, MIT, 02139, Cambridge, MA</affiliation><affiliation>E-mail: rivest@mit.edu</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2010</dateIssued><copyrightDate encoding="w3cdtf">2010</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: This paper presents a new framework–a reference architecture–for voting that we feel has many attractive features. It is not a machine design, but rather a framework that will stimulate innovation and design. It is potentially the standard architecture for all future voting equipment. The ideas expressed here are subject to improvement and further research. An early version of this paper appeared in [2]. This version of the paper is very similar, but contains a postscript (Section 8) providing commentary and discussion of perspectives on this proposal generated during the intervening years between 2001 and 2008.</abstract><relatedItem type="host"><titleInfo><title>Towards Trustworthy Elections</title><subTitle>New Directions in Electronic Voting</subTitle></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Chaum</namePart><affiliation>Independent researcher</affiliation><affiliation>E-mail: david@chaum.com</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Markus</namePart><namePart type="family">Jakobsson</namePart><affiliation>Palo Alto Research Center, CA, USA</affiliation><affiliation>E-mail: markus.jakobsson@gmail.com</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Ronald</namePart><namePart type="given">L.</namePart><namePart type="family">Rivest</namePart><affiliation>Massachusetts Institute of Technology, Cambridge, MA, USA</affiliation><affiliation>E-mail: rivest@mit.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Peter</namePart><namePart type="given">Y.</namePart><namePart type="given">A.</namePart><namePart type="family">Ryan</namePart><affiliation>University of Luxembourg, Luxembourg</affiliation><affiliation>E-mail: peter.ryan@uni.lu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josh</namePart><namePart type="family">Benaloh</namePart><affiliation>Microsoft Research Center, Redmond, WA, USA</affiliation><affiliation>E-mail: benaloh@microsoft.com</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Miroslaw</namePart><namePart type="family">Kutylowski</namePart><affiliation>Wroclaw University of Technology, Poland</affiliation><affiliation>E-mail: mirekk@swarog.im.pwr.wroc.pl</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Ben</namePart><namePart type="family">Adida</namePart><affiliation>Harvard Center for Research on Computation and Society, Boston, MA, USA</affiliation><affiliation>E-mail: ben@adida.net</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Contributed volume"></genre><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I15033">Data Encryption</topic><topic authority="SpringerSubjectCodes" authorityURI="I24067">Management of Computing and Information Systems</topic><topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I24040">Computers and Society</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic></subject><identifier type="DOI">10.1007/978-3-642-12980-3</identifier><identifier type="ISBN">978-3-642-12979-7</identifier><identifier type="eISBN">978-3-642-12980-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">211277</identifier><identifier type="BookID">978-3-642-12980-3</identifier><identifier type="BookChapterCount">24</identifier><identifier type="BookVolumeNumber">6000</identifier><identifier type="BookSequenceNumber">6000</identifier><part><date>2010</date><detail type="volume"><number>6000</number><caption>vol.</caption></detail><extent unit="pages"><start>97</start><end>106</end></extent></part><recordInfo><recordOrigin>IAVOSS/Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, Lancaster, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, Stanford, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>University of California, Los Angeles, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Doug</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2010</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>IAVOSS/Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></relatedItem><identifier type="istex">4230CA9B9E60AD16C1DA536B55577CCF7F019FA8</identifier><identifier type="DOI">10.1007/978-3-642-12980-3_5</identifier><identifier type="ChapterID">5</identifier><identifier type="ChapterID">Chap5</identifier><accessCondition type="use and reproduction" contentType="copyright">IAVOSS/Springer-Verlag Berlin Heidelberg, 2010</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2010</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/enrichments/multicat</uri></json:item><istex:refBibTEI uri="https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><monogr><title level="m" type="main">Election markup language (EML) v5.0</title><imprint><date type="published" when="2007"></date></imprint></monogr></biblStruct><biblStruct xml:id="b1"><monogr><title level="m" type="main">Voting: What is, what could be</title><author><persName><forename type="first">/</forename><surname>Caltech</surname></persName></author><author><persName><surname>Voting Technology</surname></persName></author><author><persName><surname>Project</surname></persName></author><imprint><date type="published" when="2001-07"></date></imprint></monogr></biblStruct><biblStruct xml:id="b2"><monogr><title level="m" type="main">On the notion of " software independence " in voting systems</title><author><persName><forename type="first">R</forename><forename type="middle">L</forename><surname>Rivest</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">P</forename><surname>Wack</surname></persName></author><imprint><date type="published" when="2006-07-28"></date></imprint></monogr></biblStruct><biblStruct xml:id="b3"><monogr><title level="m" type="main">Voluntary voting system guidelines</title><author><persName><forename type="first">Tdc</forename></persName></author><imprint></imprint></monogr></biblStruct><biblStruct xml:id="b4"><monogr><title level="m" type="main">Building Reliable Voting Machine Software</title><author><persName><forename type="first">K.-P</forename><surname>Yee</surname></persName></author><author><persName><forename type="first">U</forename><forename type="middle">C</forename><surname>Berkeley</surname></persName></author><author><persName><forename type="first">Eecs</forename><surname>Dept</surname></persName></author><imprint><date type="published" when="2007"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">Prerendered user interfaces for high-assurance electronic voting</title><author><persName><forename type="first">K.-P</forename><surname>Yee</surname></persName></author><author><persName><forename type="first">D</forename><surname>Wagner</surname></persName></author><author><persName><forename type="first">M</forename><surname>Hearst</surname></persName></author><author><persName><forename type="first">S</forename><surname>Bellovin</surname></persName></author></analytic><monogr><title level="m">USENIX/ACCURATE Electronic Voting Technology Workshop</title><imprint><date type="published" when="2006"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI><json:item><type>refBibs</type><uri>https://api.istex.fr/document/4230CA9B9E60AD16C1DA536B55577CCF7F019FA8/enrichments/refBibs</uri></json:item></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Amerique/explor/CaltechV1/Data/Main/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000414 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Corpus/biblio.hfd -nk 000414 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Amerique
|area= CaltechV1
|flux= Main
|étape= Corpus
|type= RBID
|clé= ISTEX:4230CA9B9E60AD16C1DA536B55577CCF7F019FA8
|texte= A Modular Voting Architecture (“Frog Voting”)
}}
| This area was generated with Dilib version V0.6.32. |  |