Review List (by number)
TEST2007 Chair
============================================================================
1. On Obfuscating Point Functions (*) [RE]
============================================================================
============================================================================
2. Logcrypt: Forward Security and Public Verification for Secure Aud (*) [RE]
============================================================================
============================================================================
3. Cryptanalysis of Hiji-bij-bij (HBB) (*) [MR]
============================================================================
============================================================================
4. Benes and Butterfly schemes revisited (*) [RE]
============================================================================
============================================================================
5. A sufficient condition for key-privacy (4) [DI]
============================================================================
Mia Hamm, Score: 4, Confidence: 3
Technical: 3, Editorial: 2, Suitability: 3
--------------------------------------------------------
Comments to Authors:
Napoleon Crossing the Alps (also known as Napoleon at the Saint-Bernard
Pass or Bonaparte Crossing the Alps) is the title given to the five
versions of an oil on canvas equestrian portrait of Napoleon Bonaparte
painted by the French artist Jacques-Louis David between 1801 and 1805.
Initially commissioned by the Spanish Ambassador to France, the
composition shows a strongly idealized view of the real crossing that
Napoleon and his army made across the Alps in 1800.
___________________________________________________________________________
Zinedine Zidane (Some One), Score: 4, Confidence: 3
Technical: 3, Editorial: 2, Suitability: 3
--------------------------------------------------------
Comments to Authors:
Some caveats:
-------------
This software is currently a PHP/MySQL software, which means that to
use it you must have a MySQL server and a PHP engine (and your web-server
must supports PHP and MySQL). I tested the software with PHP 4.3.2 and
MySQL 3.23 (both quite old now), as well as PHP 5.0.4 and MySQL 4.1.12.
It may work with even older versions (but it may not). Also, the proper
functioning of this software depend on "proper" functioning of you
web-server.
In particular, two issues that I came across are:
* The scripts must be able to write and create sub-directories in the
BASE directory. When using this software on on Linux with an Apache
server (running as user "apache"), I had to chdir to the BASE directory
and make sure the directory and all the files in it are owned by user
"apache".
* The web-server (and the PHP engine) must be willing to upload files.
For example, in one system that I used to test it, the PHP engine was
configured to only allow uploads of files upto 500KB (and I was wrecking
my brains as to why I can only upload pdf and not postscript files..) In
my case it turned out that I had to change the parameter LimitRequestBody
in php.conf (which on that system was somewhere under /etc/httpd/).
___________________________________________________________________________
* Mia Hamm: However, maybe we should consider also...
Or maybe not, who knows
* TEST2007 Chair: Re: However, maybe we should consider also...
I should know, I am the chair
============================================================================
6. A Metric on the Set of Elliptic Curves over ${mathbf F}_p$. (*) [RE]
============================================================================
============================================================================
7. The Misuse of RC4 in Microsoft Word and Excel (*) [MA]
============================================================================
============================================================================
8. Comments on "Distributed Symmetric Key Management for Mobile Ad h (*) [RE]
============================================================================
============================================================================
9. Mixing properties of triangular feedback shift registers (*) [AC]
============================================================================
============================================================================
10. Update on SHA-1 (*) [AC]
============================================================================
============================================================================
11. An Improved Elegant Method to Re-initialize Hash Chains (*) [MA]
============================================================================
============================================================================
12. Efficient Certificateless Public Key Encryption (*) [DI]
============================================================================
============================================================================
13. Comments: Insider attack on Cheng et al.s pairing-based tripartit (*) [RE]
============================================================================
============================================================================
14. A Chosen Ciphertext Attack on a Public Key Cryptosystem Based on (*) [RE]
============================================================================
============================================================================
15. Hierarchical Identity Based Encryption with Constant Size Ciphert (*) [DI]
============================================================================
============================================================================
16. Narrow T-functions (*) [MA]
============================================================================
Mia Hamm, Score: *, Confidence: 0
Technical: *, Editorial: *, Suitability: *
--------------------------------------------------------
Comments to Authors:
In this paper, we present an efficient signature scheme without random
oracles using Waters private key construction. Our scheme has shorter
public parameter size when compared to Kenny and Schuldt signature, the
signature space of our basic scheme consists of three group elements, we
further show that the signature space can be reduced to two group
elements. The security of our signature scheme is proved in the standard
model under adaptive identity security notion.
___________________________________________________________________________
Zinedine Zidane, Score: *, Confidence: 0
Technical: *, Editorial: *, Suitability: *
--------------------------------------------------------
Comments to Authors:
Bush Commutes Libby’s Prison Sentence
Doug Mills/The New York Times
WASHINGTON, July 2 — President Bush said today that he had used his power
of clemency to commute the 30-month sentence for I. Lewis Libby Jr., the
former top aide to Vice President Dick Cheney, who was convicted of
perjury in March and was due to begin serving his time within weeks.
The action, announced just hours after a federal appeals court denied Mr.
Libby’s request to allow him to remain free while his case is on appeal,
spares Mr. Libby his prison term, but it does not excuse him from stiff
fines or probation.
In a statement issued early this evening announcing his decision, Mr. Bush
said he had listened to both critics and defenders of Mr. Libby, who was
convicted of four felony counts for lying during a C.I.A. leak
investigation.
“I respect the jury’s verdict,” Mr. Bush said. “But I have concluded that
the prison sentence given to Mr. Libby is excessive. Therefore, I am
commuting the portion of Mr. Libby’s sentence that required him to spend
30 months in prison.”
___________________________________________________________________________
============================================================================
17. Side Channel Attacks on Implementations of Curve-Based Cryptograp (*) [AC]
============================================================================
============================================================================
18. Collusion Resistant Broadcast Encryption With Short Ciphertexts a (*) [AC]
============================================================================
============================================================================
19. The Full Abstraction of the UC Framework (*) [MA]
============================================================================
============================================================================
20. (De)Compositions of Cryptographic Schemes and their Applications (*) [DI]
============================================================================
============================================================================
21. Partial Hiding in Public-Key Cryptography (*) [MR]
============================================================================
============================================================================
22. An Improved and Efficient Countermeasure against Power Analysis A (*) [RE]
============================================================================
============================================================================
23. A Construction of Public-Key Cryptosystem Using Algebraic Coding (*) [RE]
============================================================================
============================================================================
24. On the Diffie-Hellman problem over $GL_{n}$ (*) [MR]
============================================================================
============================================================================
25. Analysis of Affinely Equivalent Boolean Functions (*) [DI]
============================================================================
============================================================================
26. Techniques for random maskin in hardware (*) [MA]
============================================================================
============================================================================
27. Tag-KEM/DEM: A New Framework for Hybrid Encryption (4.8) [AC]
============================================================================
Joy Fawcett, Score: 6, Confidence: 3
Technical: 2, Editorial: 2, Suitability: 2
--------------------------------------------------------
Comments to Authors:
Judge affirms ruling to dismiss Gitmo charges
WASHINGTON (CNN) -- A military judge on Friday rejected the Pentagon's
request to reinstate previously dismissed charges against a prisoner
accused of killing a U.S. soldier in Afghanistan in 2001, officials said.
A guard checks on a detainee at the U.S. naval station at Guantanamo Bay,
Cuba, in April.
Judge Army Col. Peter Brownback dropped the charges against Canadian
detainee Omar Khadr last month on the grounds Brownback's court lacked the
jurisdiction to try him.
Khadr was 15 when he was arrested.
The inability to prosecute centered on Khadr not being labeled an
"unlawful" enemy combatant.
Last June, Brownback said new congressional rules on trying detainees
specify that a detainee must be designated an "unlawful enemy combatant."
Pentagon officials would not release Brownback's most recent decision, but
said he ruled the prosecution had presented no new evidence or arguments to
change his mind.
The prosecution has five days to appeal to the Court of Military
Commissions Review in Washington.
___________________________________________________________________________
Mia Hamm, Score: 3, Confidence: 2
Technical: 1, Editorial: 2, Suitability: 3
--------------------------------------------------------
Comments to Authors:
Pairing based cryptography is a new public key cryptographic scheme. An
elliptic curve suitable for pairing based cryptography is called a
``pairing-friendly'' elliptic curve. After Mitsunari, Sakai and Kasahara's
traitor tracing scheme and Boneh and Boyen's short signature scheme, many
protocols based on pairing-related problems such as the $q$-weak
Diffie-Hellman problem have been proposed. In Eurocrypt 2006, Cheon
proposed a new efficient algorithm to solve pairing-related problems and
recently the complexity of Cheon's algorithm has been improved by Kozaki,
Kutsuma and Matsuo. Due to these two works, an influence of Cheon's
algorithm should be considered when we construct a suitable curves for the
use of a protocol based on a pairing-related problem. Among known methods
for constructing pairing-friendly elliptic curves, ones using cyclotomic
polynomials such as the Brezing-Weng method and the Freeman-Scott-Teske
method are affected by Cheon's algorithm. In this paper, we study how to
reduce a security loss of a cyclotomic family by Cheon's algorithm. The
proposed method constructs many pairing-friendly elliptic curves with
small security loss by Cheon's algorithm suitable for protocols based on
pairing-related problems.
___________________________________________________________________________
* Mia Hamm: Blah Blah
* TEST2007 Chair: Re: Blah Blah
Why do you think that?
============================================================================
28. Improved Proxy Re-Encryption Schemes with Applications to Secure (*) [AC]
============================================================================
============================================================================
29. A model and architecture for pseudo-random generation with applic (*) [AC]
============================================================================
============================================================================
30. Weak keys of pairing based Diffie Hellman schemes on elliptic cur (*) [AC]
============================================================================
============================================================================
31. The Vector Decomposition Problem for Elliptic and Hyperelliptic C (*) [AC]
============================================================================
============================================================================
32. On the Notion of Statistical Security in Simulatability Definitio (*) [RE]
============================================================================
============================================================================
33. A Flexible Framework for Secret Handshakes (*) [RE]
============================================================================
============================================================================
34. An Efficient CDH-based Signature Scheme With a Tight Security Red (*) [RE]
============================================================================
============================================================================
35. Concurrent Composition of Secure Protocols in the Timing Model (*) [RE]
============================================================================
============================================================================
36. Improving Secure Server Performance by Re-balancing SSL/TLS Hands (*) [MR]
============================================================================
============================================================================
37. Distinguishing Stream Ciphers with Convolutional Filters (*) [DI]
============================================================================
============================================================================
38. Unfairness of a protocol for certified delivery (*) [MA]
============================================================================
============================================================================
39. On the Security of a Group Signature Scheme with Strong Separabil (*) [DI]
============================================================================
============================================================================
40. Polyhedrons over Finite Abelian Groups and Their Cryptographic Ap (*) [DI]
============================================================================
============================================================================
41. An Efficient Solution to The Millionaires Problem Based on Homomo (*) [RE]
============================================================================
============================================================================
42. On the affine classification of cubic bent functions (*) [RE]
============================================================================
============================================================================
43. Choosing Parameter Sets for NTRUEncrypt with NAEP and SVES-3 (*) [RE]
============================================================================
============================================================================
44. New Approaches for Deniable Authentication (*) [DI]
============================================================================
============================================================================
45. Cryptanalysis of an anonymous wireless authentication and confere (*) [MA]
============================================================================
============================================================================
46. Cryptanalysis of two identification schemes based on an ID-based (*) [AC]
============================================================================
============================================================================
47. Adversarial Model for Radio Frequency Identification (*) [AC]
============================================================================
============================================================================
48. David Chaum's Voter Verification using Encrypted Paper Receipts (*) [MA]
============================================================================
============================================================================
49. A Note on Shor's Quantum Algorithm for Prime Factorization (*) [MR]
============================================================================
Joy Fawcett, Score: *, Confidence: 0
Technical: *, Editorial: *, Suitability: *
--------------------------------------------------------
Comments to Authors:
Search engine optimization (SEO) is the process of improving the volume and
quality of traffic to a web site from search engines via "natural" search
results. Usually, the earlier a site is presented in the search results,
or the higher it "ranks," the more searchers will visit that site. SEO can
also target different kinds of search, including image search, local
search, and industry-specific vertical search engines. As a marketing
strategy for increasing a site's relevancy, SEO considers how search
algorithms work and what people search for. SEO efforts may involve a
site's coding, presentation, and structure, as well as fixing problems
that could prevent search engine indexing programs from fully spidering a
site. Other, more noticeable efforts may include adding unique content to
a site, and making sure that the content is easily indexed by search
engines and also appeals to human visitors. The acronym "SEO" can also
refer to "search engine optimizers," a term adopted by an industry of
consultants who carry out optimization projects on behalf of clients, and
by employees who perform SEO services in-house.
___________________________________________________________________________
============================================================================
50. Picking Virtual Pockets using Relay Attacks on Contactless Smartc (*) [RE]
============================================================================
============================================================================
51. An Approach Towards Rebalanced RSA-CRT with Short Public Exponent (*) [RE]
============================================================================
============================================================================
53. Untraceability of Two Group Signature Schemes (*) [RE]
============================================================================
============================================================================
54. Key Derivation and Randomness Extraction (*) [MR]
============================================================================
============================================================================
101. A sufficient condition for key-privacy (*) [MR]
============================================================================