[Administer] [Review] [Log file] [Change password] [Documentation] [Undo/Redo]

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:
  1. 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

  1. On Obfuscating Point Functions
    Yes:
    No:

  2. Logcrypt: Forward Security and Public Verification for Secure Audit Logs
    Yes:
    No:

  3. Cryptanalysis of Hiji-bij-bij (HBB)
    Yes:
    No:

  4. Benes and Butterfly schemes revisited
    Yes:
    No:

  5. A sufficient condition for key-privacy
    Yes:
    No:

  6. A Metric on the Set of Elliptic Curves over ${mathbf F}_p$.
    Yes:
    No:

  7. The Misuse of RC4 in Microsoft Word and Excel
    Yes:
    No:

  8. Comments on "Distributed Symmetric Key Management for Mobile Ad hoc Networks" from INFOCOM 2004
    Yes:
    No:

  9. Mixing properties of triangular feedback shift registers
    Yes:
    No:

  10. Update on SHA-1
    Yes:
    No:

  11. An Improved Elegant Method to Re-initialize Hash Chains
    Yes:
    No:

  12. Efficient Certificateless Public Key Encryption
    Yes:
    No:

  13. Comments: Insider attack on Cheng et al.s pairing-based tripartite key agreement protocols
    Yes:
    No:

  14. A Chosen Ciphertext Attack on a Public Key Cryptosystem Based on Lyndon Words
    Yes:
    No:

  15. Hierarchical Identity Based Encryption with Constant Size Ciphertext
    Yes:
    No:

  16. Narrow T-functions
    Yes:
    No:

  17. Side Channel Attacks on Implementations of Curve-Based Cryptographic Primitives
    Yes:
    No:

  18. Collusion Resistant Broadcast Encryption With Short Ciphertexts and Private Keys
    Yes:
    No:

  19. The Full Abstraction of the UC Framework
    Yes:
    No:

  20. (De)Compositions of Cryptographic Schemes and their Applications to Protocols
    Yes:
    No:

  21. Partial Hiding in Public-Key Cryptography
    Yes:
    No:

  22. An Improved and Efficient Countermeasure against Power Analysis Attacks
    Yes:
    No:

  23. A Construction of Public-Key Cryptosystem Using Algebraic Coding on the Basis of Superimposition and Randomness
    Yes:
    No:

  24. On the Diffie-Hellman problem over $GL_{n}$
    Yes:
    No:

  25. Analysis of Affinely Equivalent Boolean Functions
    Yes:
    No:

  26. Techniques for random maskin in hardware
    Yes:
    No:

  27. Tag-KEM/DEM: A New Framework for Hybrid Encryption
    Yes:
    No:

  28. Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage
    Yes:
    No:

  29. A model and architecture for pseudo-random generation with applications to /dev/random
    Yes:
    No:

  30. Weak keys of pairing based Diffie Hellman schemes on elliptic curves
    Yes:
    No:

  31. The Vector Decomposition Problem for Elliptic and Hyperelliptic Curves
    Yes:
    No:

  32. On the Notion of Statistical Security in Simulatability Definitions
    Yes:
    No:

  33. A Flexible Framework for Secret Handshakes
    Yes:
    No:

  34. An Efficient CDH-based Signature Scheme With a Tight Security Reduction
    Yes:
    No:

  35. Concurrent Composition of Secure Protocols in the Timing Model
    Yes:
    No:

  36. Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes
    Yes:
    No:

  37. Distinguishing Stream Ciphers with Convolutional Filters
    Yes:
    No:

  38. Unfairness of a protocol for certified delivery
    Yes:
    No:

  39. On the Security of a Group Signature Scheme with Strong Separability
    Yes:
    No:

  40. Polyhedrons over Finite Abelian Groups and Their Cryptographic Applications
    Yes:
    No:

  41. An Efficient Solution to The Millionaires Problem Based on Homomorphic Encryption
    Yes:
    No:

  42. On the affine classification of cubic bent functions
    Yes:
    No:

  43. Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3
    Yes:
    No:

  44. New Approaches for Deniable Authentication
    Yes:
    No:

  45. Cryptanalysis of an anonymous wireless authentication and conference key distribution scheme
    Yes:
    No:

  46. Cryptanalysis of two identification schemes based on an ID-based cryptosystem
    Yes:
    No:

  47. Adversarial Model for Radio Frequency Identification
    Yes:
    No:

  48. David Chaum's Voter Verification using Encrypted Paper Receipts
    Yes:
    No:

  49. A Note on Shor's Quantum Algorithm for Prime Factorization
    Yes:
    No:

  50. Picking Virtual Pockets using Relay Attacks on Contactless Smartcard Systems
    Yes:
    No:

  51. An Approach Towards Rebalanced RSA-CRT with Short Public Exponent
    Yes:
    No:

  52. Untraceability of Two Group Signature Schemes
    Yes:
    No:

  53. Key Derivation and Randomness Extraction
    Yes:
    No:

  54. Mitigating Dictionary Attacks on Password-Protected Local Storage
    Yes:
    No:

Compute Assignments

When you hit the "Compute Assignments" button below, the reviewer preferences and your own preferences from the form above will be used to compute an assignment of reviewers to submissions, using a stable-marriage algorithm. You can use this form to modify a few parameters of this algorithm:
Note: The computed assignments will not be visible to the reviewers; you can make them visible from the manual assignment page. (explain this)
[Administer] [Review] [Log file] [Change password] [Documentation] [Undo/Redo]