Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
Our method uses shared verification based on precomputed multiplication triples. Such triples are often used to make the protocol execution itself faster, but in this work we make use of these triples especially for verification. The verification preserves the privacy guarantees of the original protocol, and it can be straightforwardly applied to protocols over finite rings, even if the same protocol performs its computation over several distinct rings at once.
tocurrencies allow mutually distrustful parties to transact
safely with each other without trusting a third-party inter-
mediary. In the event of contractual breaches or aborts, the
decentralized blockchain ensures that other honest parties
obtain commesurate remuneration. Existing systems, how-
ever, lack transactional privacy. All transactions, including
flow of money between pseudonyms and amount trasacted,
are exposed in the clear on the blockchain.
We present Hawk, a decentralized smart contract system
that does not store financial transactions in the clear on
the blockchain, thus retaining transactional privacy from the
public\'s view. A Hawk programmer can write a private smart
contract in an intuitive manner without having to implement
cryptography, and our compiler automatically generates an
efficient cryptographic protocol where contractual parties in-
teract with the blockchain, using cryptographic primitives
such as succint zero-knowledge proofs.
To formally define and reason about the security of our
protocols, we are the first to formalize the blockchain model
of secure computation. The formal modeling is of indepen-
dent interest. We advocate the community to adopt such a
formal model when designing interesting applications atop
Applicants interested in symmetric cryptography, authenticated encryption will be also considered.
We offer international research environment and competitive salary. The position is available from the 1-October 2015. Applications will be considered upon receipt, therefore applying before the deadline is encouraged.
* The position involves research in the area of IT-security within the project PAL SAaaS \'Building Triangular Trust for Secure Cloud Auduting\' in cooperation with the University of Mannheim (Prof. Dr. Frederik Armknecht).
The successful candidate is expected to contribute to research in IT-Security and applied cryptography for Cloud Security.
Besides other cloud security related aspects topics of interest for the open positions are
- application of homomorphic cryptographic primitives for secure cloud storage,
- applying the above schemes to the auditing process for cloud services.
* The position is available from August on and is fully funded. The salary scale is TV-L E13.
The gross income depends on the candidate\'s experience level. At the lowest level it corresponds to approx. 40,000 EUR per year.
* Contracts are offered for three years.
* She or he is given the possiblity to carry out a Ph.D.
* The successful candidate should have a Master\'s degree in Computer Science, Mathematics, Information Security, or a related field.
Deep Knowledge in cryptography is not a must but an asset.
* The deadline for applications is July 20, 2015. However, late applications will be considered until the position is filled.
Please send your application with reference number to Prof. Dr. Dirk Westhoff (dirk DOT westhoff AT hs-offenburg DOT de).
model, a rigid assumption about the nature of the fault. A practical challenge for all faults attacks is to identify a fault injection method that achieves the presumed fault model.
In this paper, we analyze a class of more recently proposed fault analysis techniques,
which adopt a biased fault model. Biased fault attacks enable
a more flexible fault model, and are therefore easier to adopt to practice.
The purpose of our analysis is to evaluate the relative efficiency of several recently proposed biased-fault attacks, including Fault Sensitivity Analysis (FSA), Non-Uniform Error Value Analysis (NUEVA), Non-Uniform Faulty Value Analysis (NUFVA), and Differential Fault Intensity Analysis (DFIA).
We compare the relative performance of each technique in a common framework, using a common circuit and using a common fault injection method. We show that, for an identical circuit and an identical fault injection method, the number of faults per attack greatly varies according with the analysis technique.
In particular, DFIA is more efficient than FSA, and FSA is more efficient than both NUEVA and NUFVA. In terms of number of fault injections until full key disclosure, for a typical case, FSA uses 8x more faults than DFIA, and NUEVA uses 33x more faults than DFIA. Hence, the post-processing technique selected in a biased-fault attack has a significant impact on the probability of a successful attack.
Registration for CRYPTO 2015 is now open (https://www.iacr.org/conferences/crypto2015/registration.html), which makes it a good time to let you know about a few important updates.
Paper delivery of the Journal of Cryptology is now *opt-in*. If you would like to receive hard-copy JoC editions, you must update your membership info. You can update proactively via the membership info form (https://secure.iacr.org/membership/members/update.html) or when paying your membership dues for 2016 during conference registration. If you have already paid your membership dues for 2016 you can still opt in and pay at a later time.
We have made some changes in how IACR membership records are stored internally. As a result, there is a small chance you will be asked to reset your password when authenticating. You will need access to the email address of record associated with your membership. If you experience problems, please contact the membership secretary at email@example.com.