Auto-Assignment of Submissions to Reviewers
Use this page to automatically generate an assignment of submissions
to reviewers. Each reviewer can specify his/her reviewing preferences, and
you can use the chair-preferences form to specify
your own preferences as to who should (or should not) review what submission.
Then go to the auto-assign form to have these
preferences used in a stable-marriage algorithm to compute the assignments.
(Also, the chair preferences are used to color the check-boxes in the matrix interface on the manual assignment
page. Specifically, the check-box is colored
green when you indicate that the PC-member should review the submission
or red when you indicate that the PC-member
should not review the submission.)
The assignments that are computed here can be modified from the
Manual Assignment page .
Chair Preferences
For each submission you may provide a semi-colon-separated list
of PC members that you would like to review that submission, and another
list of members that you prefer will not review that submission
(more info ).
When listing PC members, you should provide the name of the PC member as
recorded in the database. You can specify only a prefix of the name, as long
as it is sufficient to uniquely identify a single member (e.g., if you have
a committee member named Wawrzyniec C. Antroponimiczna, it may be enough to
write "Waw"). For example, to specify that you would like Attila T. Hun and
Britney Spears to review submission number 132, but not George W. Bush, you
may use the following line:
The title of submission number 132
Yes:
No:
Current PC members:
David Beckham
Fabio Cannavaro
Angelos Charisteas
Joy Fawcett
Danielle Fotopoulos
Julie Foudy
Stylianos Giannakopoulos
Mia Hamm
Devvyn Hawkins
Angela Hucles
Jena Kluegel
Amy LePeilbet
Paolo Maldini
Antonios Nikopolidis
Michael Owen
Francesco Totti
Zinedine Zidane
List of submissions
On Obfuscating Point Functions
Yes:
No:
Logcrypt: Forward Security and Public Verification for Secure Audit Logs
Yes:
No:
Cryptanalysis of Hiji-bij-bij (HBB)
Yes:
No:
Benes and Butterfly schemes revisited
Yes:
No:
A sufficient condition for key-privacy
Yes:
No:
A Metric on the Set of Elliptic Curves over ${mathbf F}_p$.
Yes:
No:
The Misuse of RC4 in Microsoft Word and Excel
Yes:
No:
Comments on "Distributed Symmetric Key Management for Mobile Ad hoc Networks" from INFOCOM 2004
Yes:
No:
Mixing properties of triangular feedback shift registers
Yes:
No:
Update on SHA-1
Yes:
No:
An Improved Elegant Method to Re-initialize Hash Chains
Yes:
No:
Efficient Certificateless Public Key Encryption
Yes:
No:
Comments: Insider attack on Cheng et al.s pairing-based tripartite key agreement protocols
Yes:
No:
A Chosen Ciphertext Attack on a Public Key Cryptosystem Based on Lyndon Words
Yes:
No:
Hierarchical Identity Based Encryption with Constant Size Ciphertext
Yes:
No:
Narrow T-functions
Yes:
No:
Side Channel Attacks on Implementations of Curve-Based Cryptographic Primitives
Yes:
No:
Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
Yes:
No:
The Full Abstraction of the UC Framework
Yes:
No:
(De)Compositions of Cryptographic Schemes and their Applications to Protocols
Yes:
No:
Partial Hiding in Public-Key Cryptography
Yes:
No:
An Improved and Efficient Countermeasure against Power Analysis Attacks
Yes:
No:
A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness
Yes:
No:
On the Diffie-Hellman problem over $GL_{n}$
Yes:
No:
Analysis of Affinely Equivalent Boolean Functions
Yes:
No:
Techniques for random maskin in hardware
Yes:
No:
Tag-KEM/DEM: A New Framework for Hybrid Encryption
Yes:
No:
Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage
Yes:
No:
A model and architecture for pseudo-random generation with applications to /dev/random
Yes:
No:
Weak keys of pairing based Diffie Hellman schemes on elliptic curves
Yes:
No:
The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves
Yes:
No:
On the Notion of Statistical Security in Simulatability Definitions
Yes:
No:
A Flexible Framework for Secret Handshakes
Yes:
No:
An Efficient CDH-based Signature Scheme With a Tight Security Reduction
Yes:
No:
Concurrent Composition of Secure Protocols in the Timing Model
Yes:
No:
Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
Yes:
No:
Distinguishing Stream Ciphers with Convolutional Filters
Yes:
No:
Unfairness of a protocol for certified delivery
Yes:
No:
On the Security of a Group Signature Scheme with Strong Separability
Yes:
No:
Polyhedrons over Finite Abelian Groups and Their Cryptographic Applications
Yes:
No:
An Efficient Solution to The Millionaires Problem Based on Homomorphic Encryption
Yes:
No:
On the affine classification of cubic bent functions
Yes:
No:
Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3
Yes:
No:
New Approaches for Deniable Authentication
Yes:
No:
Cryptanalysis of an anonymous wireless authentication and conference key distribution scheme
Yes:
No:
Cryptanalysis of two identification schemes based on an ID-based cryptosystem
Yes:
No:
Adversarial Model for Radio Frequency Identification
Yes:
No:
David Chaum's Voter Verification using Encrypted Paper Receipts
Yes:
No:
A Note on Shor's Quantum Algorithm for Prime Factorization
Yes:
No:
Picking Virtual Pockets using Relay Attacks on Contactless Smartcard Systems
Yes:
No:
An Approach Towards Rebalanced RSA-CRT with Short Public Exponent
Yes:
No:
Untraceability of Two Group Signature Schemes
Yes:
No:
Key Derivation and Randomness Extraction
Yes:
No:
A sufficient condition for key-privacy
Yes:
No:
Note: The computed assignments will not be visible to the reviewers;
you can make them visible from the manual assignment page. (explain this )