Lecture 18: Mix net Voting Systems
|
|
- Sarah Gordon
- 6 years ago
- Views:
Transcription
1 6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified he requiremens from such a sysem. In paricular, we required an elecronic voing sysem o be verifiable and robus. Loosely speaking, a voing sysem is said o be verifiable if any individual can verify ha his voe was couned. A voing sysem is said o be robus if here does no exis any small se of servers ha can disrup he elecion. The voing sysems ha appear in he lieraure can be roughly caegorized ino hree groups: one based on mix nes, one based on homomorphic encrypions, and one based on blind signaures. In his lecure we concenrae on mix ne proocols. We describe wo ypes of mix ne proocols: decrypion mix nes and re encrypion mix nes. The general srucure of mix nes was illusraed in he previous lecure. They begin wih an iniial encrypion phase E, whose oupus are posed on a bullein board, in order o achieve verifiabiliy. The iniial encrypion phase is followed by several mix phases mix 1,..., mix k. The reason we need several of hem is o achieve robusness. In decrypion mix nes, he mix phases mix and parially decryp, whereas in re encrypion mix nes, he mix phases mix and re encryp. In re encrypion mix nes a final decrypion phase D is added. 2 Decrypion Mix Ne A decrypion mix ne does no have a final decrypion phase. Raher, he iniial encrypion phase E encryps is inpus by applying a concaenaion of k encrypion operaions o each inpu; each mix peels off one of hese encrypions by applying a corresponding decrypion algorihm; i hen mixes all is decryped inpus by applying a secre random permuaion o hem. Thus, his scheme has he srucure of an onion; E builds he onion, and each mix peels off one layer of he onion. More specifically, each mix has is own pair of keys. We denoe he keys of mix i by (SK i, P K i ). mix i decryps is inpus using is keys (SK i, P K i ); i hen secrely permues all is decryped inpus. The iniial encrypion E has he public keys of all he mixes (P K 1,..., P K k ); i encryps each inpu by firs encryping i wih P K k, hen encryping he resul wih P K k 1, hen encryping he resul wih P K k 2, and so on. Thus, if we denoe he ballos by B 1,..., B n, hen for each i = 1,..., n, C i = E(B i ) = E(P K 1... E(P K k 1, E(P K k, B i ))...). There are some issues ha need o be addressed: 18 1
2 1. Noe ha secure encrypion schemes do no hide he lengh of he plain exs. Since he oupus of E appear publicly on a bullein board, in order o preserve secrecy, we mus require all he cipher exs o be of he same lengh. 2. Noe ha ha mix k (he las mix) generaes he final oupu of he voe. Thus, if he doesn like he oupu he may abor. One way of prevening mix k from aboring, is by making his secre shared. This arouses furher issues, such as key managemen. 3. I seems like semanic securiy is enough, assuming he encryped ballos are publicized only afer all he voers have voed. Oherwise, we need a sronger securiy noion, such as CCA2 securiy, in order o achieve non malleabiliy. 4. The above proocol, as described, is neiher verifiable nor robus. In order o achieve hese wo desired properies, we need o add some ingrediens o he proocol. These ingrediens will be added following he descripion of re encrypion mix nes. 3 Re encrypion Mix nes As opposed o a mix phase in a decrypion mix ne, whose role is boh o mix and o parially decryp, he role of a mix phase in a re encrypion mix ne is only o mix. Noe, however, ha a mix which merely scrambles he inpus is no good enough. This is so, since by merely scrambling, he resuling se of cipherexs does no change, and hus for each resuling cipherex i is easy o recover he voer associaed wih i. Thus, an exra operaion is needed in order o mix in an unrecoverable way. In a re encrypion mix ne, he exra operaion added o each mix phase is a re encrypion operaion. In oal, a re encrypion mix ne consiss of an iniial encrypion phase E, several mix phases mix i,..., mix k, who mix by scrambling and re encryping, and a final decrypion phase D. Typically, he encrypion scheme used in a re encrypion mix ne is he El Gamal encrypion scheme, which has a nice re encrypion propery. In wha follows, we describe in more deail an El Gamal based re encrypion mix ne. 3.1 El Gamal Based Re encrypion Mix nes Recall ha in he El Gamal encrypion scheme, an encrypion of a message m, wih respec o a public key (p, g, y), consiss of a pair (g r, my r ), where all he operaions are done modulo p, and r R Z q where q is a large prime dividing p 1, where g is a generaor of he subgroup of elemens whose order divides q, and m is in his subgroup. The secre key corresponding o (p, g, y) is x such ha g x = y(mod p). The El Gamal encrypion scheme has he following nice re encryping propery: any encryped message (a, b) = (g r, my r ) can be re encryped by choosing a random s R Z q and compuing (ag s, by s ) = (g r+s, my r+s ). Noe ha his re encryping operaion resuls wih a random cipherex for he same message m. We are now ready o define he El Gamal based re encrypion mix ne: 1. An El Gamal public key (p, g, y) is generaed (in some disribued manner). 18 2
3 2. The iniial encrypion phase E simply encryps all he ballos B 1,..., B n by applying he El Gamal encrypion algorihm wih he public key (p, g, y). I hen poss all he resuling cipherexs (C 1,0,..., C n,0 ) on a bullein board. 3. The i h mix phase, on inpu a se of cipherexs (C 1,i 1,..., C n,i 1 ), re encryps each cipherex and permues he resuling cipherexs using a secrely chosen random permuaion. 4. The final decrypion phase D, given a se of cipherexs (C 1,k,..., C n,k ), simply decryps all he cipherexs in some disribued manner (in order o achieve robusness). 3.2 Verifiabiliy and Robusness Recall ha a voing sysem is said o be verifiable if all voers can verify ha heir voe was couned. A voing sysem is said o be robus is a small se of servers canno disrup he elecion. Noe ha he above mix ne proocol is neiher verifiable nor robus. In order o obain hese wo properies several ingrediens mus be added o he proocol. In paricular, one ingredien which may be added is he requiremen ha each mix server prove ha he has indeed done he correc operaion. Namely, each mix i will be required o prove ha here exiss a permuaion π such ha C j,i is a re encrypion of C π(j),i 1, for j = 1,..., n. In wha follows we consider he simpler ask of merely proving ha one cipherex is a re encrypion of anoher. Le c 1 = (α 1, β 1 ) = (g, m 1 y ) and c 2 = (α 2, β 2 ) = (g u, m 2 y u ) be any wo cipherexs. Noe ha c 2 is a re encrypion of c 1 if and only if c 1 and c 2 are boh encrypions of he same message. Consider he uple m 2 (g, y, α 2, β 2 ) = (g, y, g u, y u ). α 1 β 1 m 1 Thus, c 2 is a re encrypion of c 1 if and only if (g, y, α1, β 2 β 1 ) is a DDH uple, i.e., uple of he form (g, y, g r, y r ), which is equivalen o being a uple of he form (g, g x, g r, g rx ). Thus, proving ha c 2 is a re encrypion of c 1 boils down o proving ha (g, y, g r, y r ) DDH. In wha follows we describe he Chaum Pederson proocol [CP92] for proving ha a uple (g, y, w, u) = (g, g x, g r, g rx ) is a DDH uple. α 2 P V s Z q s (a, b) = (g, y s ) c c Z q accep if and only if = s + cr g = aw c y = buc I is easy o verify ha he above proocol is an hones verifier zero knowledge proof ofknowledge proocol. Remarks: 18 3
4 1. Neff proposed a slighly differen re encrypion mix ne, also based on El Gamal. In Neff s proocol a re encrypion operaion consiss in par of aking a cipherex (a, b) and generaing anoher cipherex (a c, b c ), for a randomly chosen c R Z q. Noe ha his operaion does change he encryped message from m o m c. The moivaion behind Neff s scheme is ha he manages o give efficien zero knowledge proofs, which involve only a linear (in n) number of exponeniaions. 2. There are faser proocols ha are no zero knowledge, such as he one proposed by Boneh and Golle [BG02] and he one proposed by Jacobsson, Juels and Rives [JJR02]. Boh use new echniques o verify correcness. In [BG02], for each mix server, he produc of a random subse of is inpus is compued, and he mix server is required o produce a subse of oupus of equal producs. In [JJR02], a new echnique is used, called randomized parial checking, in which each server provides srong evidence of is correc operaion by revealing a pseudo randomly seleced subse of is inpu/oupu relaions. 3.3 An overview of an El Gamal based Re encrypion Mix ne 1. Voers voe. 2. An El Gamal public key (p, g, y) is produced (in a disribued manner) 3. The iniial encrypion phase is performed. 4. All he mix phases are performed. 5. Each mix phase produces a proof. The proof includes a non ineracive version of he Chaum Pederson proof, obained by applying he following Fia Shamir ype sep: he challenge is compued by applying some pseudo random funcion o he firs message and o he conen of he bullein board; he seed o he pseudo random funcion is chosen in a disribued manner. 6. All he proofs are checked, and if hey are correc, hen he decrypion phase is performed by applying a hreshold decrypion. If a proof of mix i fails, hen he bad server mix i is skipped and all he mix phases mix i+1,..., mix k are redone. Noe ha so far we only showed how o prove ha one cipherex is a re encrypion of anoher cipherex. We didn show how o fully prove ha a mix operaed correcly. References [BG02] D. Boneh and P. Golle. Almos enirely correc mixing wih applicaions o voing. ACM Conference on Compuer and Communicaions Securiy 2002: [CP92] D. Chaum and T. P. Pedersen. Walle Daabases wih Observers. CRYPTO 1992:
5 [JJR02] M. Jakobsson, A. Juels, and R. Rives. Making Mix Nes Robus for Elecronic Voing by Randomized Parial Checking. In D. Boneh, ed., USENIX Securiy 02, pp (Also available as IACR eprin 2002/025.) 18 5
A Matching Algorithm for Content-Based Image Retrieval
A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using
More informationSam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.
8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged
More informationGauss-Jordan Algorithm
Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried
More informationShortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.
Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah
More informationUsing CANopen Slave Driver
CAN Bus User Manual Using CANopen Slave Driver V1. Table of Conens 1. SDO Communicaion... 1 2. PDO Communicaion... 1 3. TPDO Reading and RPDO Wriing... 2 4. RPDO Reading... 3 5. CANopen Communicaion Parameer
More informationImplementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)
Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,
More informationCMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols
CMPSC 274: Transac0on Processing Lecure #6: Concurrency Conrol Proocols Divy Agrawal Deparmen of Compuer Science UC Sana Barbara 4.4.1 Timesamp Ordering 4.4.2 Serializa0on Graph Tes0ng 4.4.3 Op0mis0c Proocols
More informationAssignment 2. Due Monday Feb. 12, 10:00pm.
Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how
More information4 Error Control. 4.1 Issues with Reliable Protocols
4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can
More informationPART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR
. ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationChapter 4 Sequential Instructions
Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",
More informationCENG 477 Introduction to Computer Graphics. Modeling Transformations
CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World
More informationComputer representations of piecewise
Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom
More informationCOMP26120: Algorithms and Imperative Programming
COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48
More informationData Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2
Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,
More informationAn efficient approach to improve throughput for TCP vegas in ad hoc network
Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: 395-0056 Volume: 0 Issue: 03 June-05 www.irje.ne p-issn: 395-007 An efficien approach o improve hroughpu for TCP vegas in ad hoc
More informationScheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012
EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule
More informationAxiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries
Axiomaic Foundaions and Algorihms for Deciding Semanic Equivalences of SQL Queries Shumo Chu, Brendan Murphy, Jared Roesch, Alvin Cheung, Dan Suciu Paul G. Allen School of Compuer Science and Engineering
More informationUser Manual. RINS Software Revision >V9.26
User Manual INTERNAL SIREN WARNING The Enforcer 32-WE conrol panel conains a 100 dba siren, please be aware of his when in use. RINS1503-2 Sofware Revision >V9.26 Conens Page A: Inroducion 3 B: Keypads
More informationSTEREO PLANE MATCHING TECHNIQUE
STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo
More informationAn Improved Square-Root Nyquist Shaping Filter
An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com
More informationEECS 487: Interactive Computer Graphics
EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified
More informationImproving Ranking of Search Engines Results Based on Power Links
IPASJ Inernaional Journal of Informaion Technology (IIJIT) Web Sie: hp://www.ipasj.org/iijit/iijit.hm A Publisher for Research Moivaion... Email: edioriiji@ipasj.org Volume 2, Issue 9, Sepember 2014 ISSN
More informationProtecting User Privacy in a Multi-Path Information-Centric Network Using Multiple Random-Caches
Chu WB, Wang LF, Jiang ZJ e al. Proecing user privacy in a muli-pah informaion-cenric nework using muliple random-caches. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 32(3): 585 598 May 27. DOI.7/s39-7-73-2
More information4. Minimax and planning problems
CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems
More informationEvaluation and Improvement of Region-based Motion Segmentation
Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac
More informationPetri Nets for Object-Oriented Modeling
Peri Nes for Objec-Oriened Modeling Sefan Wi Absrac Ensuring he correcness of concurren rograms is difficul since common aroaches for rogram design do no rovide aroriae mehods This aer gives a brief inroducion
More informationsource managemen, naming, proecion, and service provisions. This paper concenraes on he basic processor scheduling aspecs of resource managemen. 2 The
Virual Compuers A New Paradigm for Disribued Operaing Sysems Banu Ozden y Aaron J. Goldberg Avi Silberschaz z 600 Mounain Ave. AT&T Bell Laboraories Murray Hill, NJ 07974 Absrac The virual compuers (VC)
More informationTest - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version
Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing
More informationMOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018
MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationMOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:
MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationVideo Content Description Using Fuzzy Spatio-Temporal Relations
Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer
More informationAML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves
AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves
More informationSimple Network Management Based on PHP and SNMP
Simple Nework Managemen Based on PHP and SNMP Krasimir Trichkov, Elisavea Trichkova bsrac: This paper aims o presen simple mehod for nework managemen based on SNMP - managemen of Cisco rouer. The paper
More informationCAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL
CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz
More informationConcurrency Control and Recovery in Transactional Process Management
In: Proceedings of he ACM Symposium on Principles of Daabase Sysems (PODS 99), pages 316-326, Philadelphia, Pennsylvania, USA, May/June, 1999. Concurrency Conrol and Recovery in Transacional Process Managemen
More informationRestorable Dynamic Quality of Service Routing
QOS ROUTING Resorable Dynamic Qualiy of Service Rouing Murali Kodialam and T. V. Lakshman, Lucen Technologies ABSTRACT The focus of qualiy-of-service rouing has been on he rouing of a single pah saisfying
More informationA Formalization of Ray Casting Optimization Techniques
A Formalizaion of Ray Casing Opimizaion Techniques J. Revelles, C. Ureña Dp. Lenguajes y Sisemas Informáicos, E.T.S.I. Informáica, Universiy of Granada, Spain e-mail: [jrevelle,almagro]@ugr.es URL: hp://giig.ugr.es
More informationTowards a Realistic Model for Failure Propagation in Interdependent Networks
Towards a Realisic Model for Failure Propagaion in Inerdependen Neworks Agosino Suraro, Simone Silvesri, Mauro Coni, Sajal K. Das Deparmen of Mahemaics, Universiy of Padua, email: agosino.suraro@sudeni.unipd.i,
More informationarxiv: v1 [cs.na] 11 May 2017
Cache-oblivious Marix Muliplicaion for Exac Facorisaion arxiv:175.487v1 [cs.na] 11 May 217 Faima K. Abu Salem 1 Compuer Science Deparmen, American Universiy of Beiru, P. O. Box 11-236, Riad El Solh, Beiru
More informationAn Efficient Delivery Scheme for Coded Caching
201 27h Inernaional Teleraffic Congress An Efficien Delivery Scheme for Coded Caching Abinesh Ramakrishnan, Cedric Wesphal and Ahina Markopoulou Deparmen of Elecrical Engineering and Compuer Science, Universiy
More informationDistributed Task Negotiation in Modular Robots
Disribued Task Negoiaion in Modular Robos Behnam Salemi, eer Will, and Wei-Min Shen USC Informaion Sciences Insiue and Compuer Science Deparmen Marina del Rey, USA, {salemi, will, shen}@isi.edu Inroducion
More informationRule-Based Multi-Query Optimization
Rule-Based Muli-Query Opimizaion Mingsheng Hong Dep. of Compuer cience Cornell Universiy mshong@cs.cornell.edu Johannes Gehrke Dep. of Compuer cience Cornell Universiy johannes@cs.cornell.edu Mirek Riedewald
More informationConstruction Process. Transactional Process Scheduler. Production Process. 2.3 Transactional Subsystems. Test. CAD Documentation. Conflict!
Philadelphia, Pennsylvania, USA, May 31 - June 2, 1999. Concurrency Conrol and Recovery in Transacional Process Managemen Heo Schuld Gusavo Alonso Insiue of Informaion Sysems Swiss Federal Insiue of Technology
More informationOn the Impact of Concurrency for the Enforcement of Entailment Constraints in Process-driven SOAs
On he Impac of Concurrency for he Enforcemen of Enailmen Consrains in Process-driven OAs Thomas Quirchmayr and Mark rembeck Insiue for Informaion ysems, New Media Lab, WU Vienna, Ausria {firsname.lasname}@wu.ac.a
More informationBI-TEMPORAL INDEXING
BI-TEMPORAL INDEXING Mirella M. Moro Uniersidade Federal do Rio Grande do Sul Poro Alegre, RS, Brazil hp://www.inf.ufrgs.br/~mirella/ Vassilis J. Tsoras Uniersiy of California, Rierside Rierside, CA 92521,
More informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationData Structures and Algorithms
Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common
More informationSOT: Compact Representation for Triangle and Tetrahedral Meshes
SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner
More informationAnalysis of Various Types of Bugs in the Object Oriented Java Script Language Coding
Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened
More informationA Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.
Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal
More informationA time-space consistency solution for hardware-in-the-loop simulation system
Inernaional Conference on Advanced Elecronic Science and Technology (AEST 206) A ime-space consisency soluion for hardware-in-he-loop simulaion sysem Zexin Jiang a Elecric Power Research Insiue of Guangdong
More informationPrecise Voronoi Cell Extraction of Free-form Rational Planar Closed Curves
Precise Voronoi Cell Exracion of Free-form Raional Planar Closed Curves Iddo Hanniel, Ramanahan Muhuganapahy, Gershon Elber Deparmen of Compuer Science Technion, Israel Insiue of Technology Haifa 32000,
More informationthe large energy consumption on the LLK establishment. Combinatorial design techniques are proposed in [8], [9]. They can
I SCALABLE LINK-LAYER KEY AGREEMENT IN SENSOR NETWORKS Yun Zhou and Yuguang Fang Deparmen of Elecrical and Compuer Engineering Universiy of Florida, Gainesville, FL 326 Tel: (352)392-8576; Fax: (352)392-0044
More informationProject #1 Math 285 Name:
Projec #1 Mah 85 Name: Solving Orinary Differenial Equaions by Maple: Sep 1: Iniialize he program: wih(deools): wih(pdeools): Sep : Define an ODE: (There are several ways of efining equaions, we sar wih
More informationMotor Control. 5. Control. Motor Control. Motor Control
5. Conrol In his chaper we will do: Feedback Conrol On/Off Conroller PID Conroller Moor Conrol Why use conrol a all? Correc or wrong? Supplying a cerain volage / pulsewidh will make he moor spin a a cerain
More informationTHE EQUIVALENCE OF MODELS OF TASKING + by Daniel M. Berry Brown University
THE EQUVALENCE OF MODELS OF TASKNG + by Daniel M. Berry Brown Universiy Absrac. A echnique for proving he equivalence of implemenaions of muli-asking programming languages is developed and applied o proving
More informationDesign Alternatives for a Thin Lens Spatial Integrator Array
Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of
More information1.4 Application Separable Equations and the Logistic Equation
1.4 Applicaion Separable Equaions and he Logisic Equaion If a separable differenial equaion is wrien in he form f ( y) dy= g( x) dx, hen is general soluion can be wrien in he form f ( y ) dy = g ( x )
More informationCoded Caching with Multiple File Requests
Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a
More informationFIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS
FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2
More informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
More informationAn Adaptive Spatial Depth Filter for 3D Rendering IP
JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod
More informationECO-friendly Distributed Routing Protocol for Reducing Network Energy Consumption
ECO-friendly Disribued Rouing Proocol for Reducing Nework Energy Consumpion Daisuke Arai and Kiyohio Yoshihara KDDI R&D Laboraories Inc. 2-1-15 Ohara Fujimino-shi Saiama, Japan Email: {di-arai, yosshy}@kddilabs.jp
More informationScalable Big Graph Processing in MapReduce
Scalable Big Graph Processing in MapReduce Lu Qin,JeffreyXuYu,LijunChang,HongCheng,ChengqiZhang, Xuemin Lin Cenre for Quanum Compuaion and Inelligen Sysems, Universiy of Technology, Sydney, Ausralia The
More informationChapter 8 LOCATION SERVICES
Disribued Compuing Group Chaper 8 LOCATION SERVICES Mobile Compuing Winer 2005 / 2006 Overview Mobile IP Moivaion Daa ransfer Encapsulaion Locaion Services & Rouing Classificaion of locaion services Home
More informationVisual Indoor Localization with a Floor-Plan Map
Visual Indoor Localizaion wih a Floor-Plan Map Hang Chu Dep. of ECE Cornell Universiy Ihaca, NY 14850 hc772@cornell.edu Absrac In his repor, a indoor localizaion mehod is presened. The mehod akes firsperson
More informationLandmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases
Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu
More informationRobust LSTM-Autoencoders for Face De-Occlusion in the Wild
IEEE TRANSACTIONS ON IMAGE PROCESSING, DRAFT 1 Robus LSTM-Auoencoders for Face De-Occlusion in he Wild Fang Zhao, Jiashi Feng, Jian Zhao, Wenhan Yang, Shuicheng Yan arxiv:1612.08534v1 [cs.cv] 27 Dec 2016
More informationLearning in Games via Opponent Strategy Estimation and Policy Search
Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen
More informationHidden Markov Model and Chapman Kolmogrov for Protein Structures Prediction from Images
Hidden Markov Model and Chapman Kolmogrov for Proein Srucures Predicion from Images Md.Sarwar Kamal 1, Linkon Chowdhury 2, Mohammad Ibrahim Khan 2, Amira S. Ashour 3, João Manuel R.S. Tavares 4, Nilanjan
More informationRepresenting Non-Manifold Shapes in Arbitrary Dimensions
Represening Non-Manifold Shapes in Arbirary Dimensions Leila De Floriani,2 and Annie Hui 2 DISI, Universiy of Genova, Via Dodecaneso, 35-646 Genova (Ialy). 2 Deparmen of Compuer Science, Universiy of Maryland,
More informationA New Semantic Cache Management Method in Mobile Databases
Journal o Compuer Science 1 (3): 351-354, 25 ISSN 1549-3636 Science Publicaions, 25 A New Semanic Cache Managemen Mehod in Mobile Daabases Shengei Shi, Jianzhong Li and Chaokun Wang School o Compuer Science
More informationA Progressive-ILP Based Routing Algorithm for Cross-Referencing Biochips
16.3 A Progressive-ILP Based Rouing Algorihm for Cross-Referencing Biochips Ping-Hung Yuh 1, Sachin Sapanekar 2, Chia-Lin Yang 1, Yao-Wen Chang 3 1 Deparmen of Compuer Science and Informaion Engineering,
More informationNEWTON S SECOND LAW OF MOTION
Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during
More informationA GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER
A GRAPHICS PROCESSING UNIT IMPLEMENTATION OF THE PARTICLE FILTER ABSTRACT Modern graphics cards for compuers, and especially heir graphics processing unis (GPUs), are designed for fas rendering of graphics.
More informationReliability Analysis for Cryptographic Key Management
Reliabiliy Analysis for Crypographic Key Managemen 1 Sheng Xiao, 2 Weibo Gong, 3 Don Towsley, 4, 5 Qingquan Zhang, 5 Ting Zhu 1 College of Informaion Science and Engineering, Hunan Universiy, China 2 Dep.
More informationtr_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Report no TR-22/88
r_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Repor no TR-22/88 Deparmen of Compuer Science and Sysems McMaser Universiy 1988 McESE-FranzLISP: McMASTER
More informationConstant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun
More informationIntentSearch:Capturing User Intention for One-Click Internet Image Search
JOURNAL OF L A T E X CLASS FILES, VOL. 6, NO. 1, JANUARY 2010 1 InenSearch:Capuring User Inenion for One-Click Inerne Image Search Xiaoou Tang, Fellow, IEEE, Ke Liu, Jingyu Cui, Suden Member, IEEE, Fang
More informationPo,,ll. I Appll I APP2 I I App3 I. Illll Illlllll II Illlll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illlll Illl Illl Illl
Illll Illlllll II Illlll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illll Illlll Illl Illl Illl US 20110153728A1 (19) nied Saes (12) Paen Applicaion Publicaion (10) Pub. No.: S 2011/0153728
More informationLecture 4. Programming with Message Passing: Applications and Performance
Lecure 4 Programming wih Message Passing: Applicaions and Performance Announcemens Quiz #1 in secion on 10/13 Miderm: evening of 10/30, 7:00 o 8:20 PM Wednesday s office hours sar a 1.30 (res of he quarer)
More informationSTRING DESCRIPTIONS OF DATA FOR DISPLAY*
SLAC-PUB-383 January 1968 STRING DESCRIPTIONS OF DATA FOR DISPLAY* J. E. George and W. F. Miller Compuer Science Deparmen and Sanford Linear Acceleraor Cener Sanford Universiy Sanford, California Absrac
More informationWho thinks who knows who? Socio-Cognitive Analysis of an Network
Who hinks who knows who? Socio-Cogniive Analysis of an Email Nework Nishih Pahak Deparmen of Compuer Science Universiy of Minnesoa Minneapolis, MN, USA npahak@cs.umn.edu Sandeep Mane Deparmen of Compuer
More informationService Oriented Solution Modeling and Variation Propagation Analysis based on Architectural Building Blocks
Carnegie Mellon Universiy From he SelecedWorks of Jia Zhang Ocober, 203 Service Oriened Soluion Modeling and Variaion Propagaion Analysis based on Archiecural uilding locks Liang-Jie Zhang Jia Zhang Available
More informationNRMI: Natural and Efficient Middleware
NRMI: Naural and Efficien Middleware Eli Tilevich and Yannis Smaragdakis Cener for Experimenal Research in Compuer Sysems (CERCS), College of Compuing, Georgia Tech {ilevich, yannis}@cc.gaech.edu Absrac
More informationThe University of Sheffield Department of Computer Science. Indexing XML Databases: Classifications, Problems Identification and a New Approach
The Universiy of Sheffield Deparmen of Compuer Science Indexing XML Daabases: Classificaions, Problems Idenificaion and a New Approach Research Memorandum CS-7-5 Mohammed Al-Badawi Compuer Science Dep
More informationApplications of N-Structures to Ideal Theory of LA-Semigroup
Appl. Mah. Inf. Sci. Le. 4, No. 3, 97-02 (206) 97 Applied Mahemaics & Informaion Sciences Leers An Inernaional Journal hp://d.doi.org/0.8576/amisl/04030 Applicaions of N-Srucures o Ideal Theor of LA-Semigroup
More informationOutline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state
Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog
More informationPerformance Evaluation of Implementing Calls Prioritization with Different Queuing Disciplines in Mobile Wireless Networks
Journal of Compuer Science 2 (5): 466-472, 2006 ISSN 1549-3636 2006 Science Publicaions Performance Evaluaion of Implemening Calls Prioriizaion wih Differen Queuing Disciplines in Mobile Wireless Neworks
More informationRobust Multi-view Face Detection Using Error Correcting Output Codes
Robus Muli-view Face Deecion Using Error Correcing Oupu Codes Hongming Zhang,2, Wen GaoP P, Xilin Chen 2, Shiguang Shan 2, and Debin Zhao Deparmen of Compuer Science and Engineering, Harbin Insiue of Technolog
More informationOpportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links
1 in Low-uy-ycle Wireless Sensor Neworks wih Unreliable Links Shuo uo, Suden Member, IEEE, Liang He, Member, IEEE, Yu u, Member, IEEE, o Jiang, Suden Member, IEEE, and Tian He, Member, IEEE bsrac looding
More informationImage segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding
Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same
More informationResearch Article Auto Coloring with Enhanced Character Registration
Compuer Games Technology Volume 2008, Aricle ID 35398, 7 pages doi:0.55/2008/35398 Research Aricle Auo Coloring wih Enhanced Characer Regisraion Jie Qiu, Hock Soon Seah, Feng Tian, Quan Chen, Zhongke Wu,
More informationA Bayesian Approach to Video Object Segmentation via Merging 3D Watershed Volumes
A Bayesian Approach o Video Objec Segmenaion via Merging 3D Waershed Volumes Yu-Pao Tsai 1,3, Chih-Chuan Lai 1,2, Yi-Ping Hung 1,2, and Zen-Chung Shih 3 1 Insiue of Informaion Science, Academia Sinica,
More informationUSBFC (USB Function Controller)
USBFC () EIFUFAL501 User s Manual Doc #: 88-02-E01 Revision: 2.0 Dae: 03/24/98 (USBFC) 1. Highlighs... 4 1.1 Feaures... 4 1.2 Overview... 4 1.3 USBFC Block Diagram... 5 1.4 USBFC Typical Sysem Block Diagram...
More informationA METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS
A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,
More information1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.
DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole
More information