131 research outputs found
A Subexponential Construction of Graph Coloring for Multiparty Computation
No full textAbstract. We show the first deterministic construction of an uncondi-tionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both op-timal and has subexponential complexity of construction. More specif-ically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the (deter-ministic) constructions from Desmedt et al. (2012) our construction is subexponential and optimal at the same time, i.e., it is secure for any t < n2. 2 H. J. Asghar, Y.Desmedt, J. Pieprzyk and R. Steinfeld
Protocols with Security Proofs for Mobile Applications
No full textPreface\ud
\ud
The 9th Australasian Conference on Information Security and Privacy (ACISP\ud
2004) was held in Sydney, 13–15 July, 2004. The conference was sponsored by\ud
the Centre for Advanced Computing – Algorithms and Cryptography (ACAC),\ud
Information and Networked Security Systems Research (INSS), Macquarie University\ud
and the Australian Computer Society.\ud
\ud
The aims of the conference are to bring together researchers and practitioners\ud
working in areas of information security and privacy from universities, industry\ud
and government sectors. The conference program covered a range of aspects\ud
including cryptography, cryptanalysis, systems and network security.\ud
\ud
The program committee accepted 41 papers from 195 submissions. The reviewing\ud
process took six weeks and each paper was carefully evaluated by at\ud
least three members of the program committee. We appreciate the hard work\ud
of the members of the program committee and external referees who gave many\ud
hours of their valuable time.\ud
\ud
Of the accepted papers, there were nine from Korea, six from Australia, five\ud
each from Japan and the USA, three each from China and Singapore, two each\ud
from Canada and Switzerland, and one each from Belgium, France, Germany,\ud
Taiwan, The Netherlands and the UK. All the authors, whether or not their\ud
papers were accepted, made valued contributions to the conference.\ud
\ud
In addition to the contributed papers, Dr Arjen Lenstra gave an invited talk,\ud
entitled Likely and Unlikely Progress in Factoring.\ud
This year the program committee introduced the Best Student Paper Award.\ud
\ud
The winner of the prize for the Best Student Paper was Yan-Cheng Chang from\ud
Harvard University for his paper Single Database Private Information Retrieval\ud
with Logarithmic Communication.\ud
\ud
We would like to thank all the people involved in organizing this conference.\ud
In particular we would like to thank members of the organizing committee for\ud
their time and efforts, Andrina Brennan, Vijayakrishnan Pasupathinathan, Hartono\ud
Kurnio, Cecily Lenton, and members from ACAC and INSS
A New Attack on the LEX Stream Cipher
No full textsponsorship: [
"The first author was supported by the France Telecome Chaire. Some of the work presented in this paper was done while the first author was staying at K.U. Leuven, Belgium and supported by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy).",
"The second author is supported by the Adams Fellowship Program of the Israel Academy of Sciences and Humanities."
] (France Telecome Chaire, IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy), Israel Academy of Sciences and Humanities)status: Publishe
Rebound Attacks on the Reduced Grøstl Hash Function
No full textsponsorship: This work was supported in part by the European Commission through the ICT programme under contract ICT-2007-216676 ECRYPT II and the fourth author is supported by a grant from the Villum Kann Rasmussen Foundation. Parts of this work were carried out while the third author was visiting Technical University of Denmark, supported by a grant from DCAMM International Graduate Research School, Danish Center for Applied Mathematics and Mechanics (European Commission through the ICT programme|ICT-2007-216676 ECRYPT II, Villum Kann Rasmussen Foundation, DCAMM International Graduate Research School, Danish Center)status: Publishe
Data flow analysis of embedded program expressions
No full textData flow analysis techniques can be used to help assess threats to data confidentiality and integrity in security critical program code. However, a fundamental weakness of static analysis techniques is that they overestimate the ways in which data may propagate at run time. Discounting large numbers of these false-positive data flow paths wastes an information security evaluator's time and effort. Here we show how to automatically eliminate some false-positive data flow paths by precisely modelling how classified data is blocked by certain expressions in embedded C code. We present a library of detailed data flow models of individual expression elements and an algorithm for introducing these components into conventional data flow graphs. The resulting models can be used to accurately trace byte-level or even bit-level data flow through expressions that are normally treated as atomic. This allows us to identify expressions that safely downgrade their classified inputs and thereby eliminate false-positive data flow paths from the security evaluation process. To validate the approach we have implemented and tested it in an existing data flow analysis toolkit
A combinatorial approach to anonymous membership broadcast
No full textA set system (X, F\ud
) with X= {x 1,...,x m}) and F\ud
= {B1...,B n }, where B i ⊆ X, is called \ud
an (n, m) cover-free set system (or CF set system) if for any 1 ≤ i, j, k ≤ n and j ≠ k, |B i >2 |B j ∩ B k | +1. In this paper, we show that CF set systems can be used to construct anonymous membership broadcast schemes (or AMB schemes), allowing a center to broadcast a secret identity among a set of users in a such way that the users can verify whether or not the broadcast message contains their valid identity. Our goal is to construct (n, m) CF set systems in which for given m the value n is as large as possible. We give two constructions for CF set systems, the first one from error-correcting codes and the other from combinatorial designs. We link CF set systems to the concept of cover-free family studied by Erdös et al in early 80’s to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application
Revisiting higher-order DPA attacks: Multivariate mutual information analysis
No full textContains fulltext :
84085.pdf (author's version ) (Open Access)CT-RSA 210, 01 januari 201
The eight variable homogeneous degree three bent functions
No full textWe determine the affine equivalence classes of the eight variable degree three homogeneous bent functions using a new algorithm. Our algorithm applies to general bent functions and can systematically determine the automorphism groups. We provide a partial verification of the enumeration of eight variable degree three homogeneous bent functions obtained by Meng et al. We determine the affine equivalence classes of these functions
Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards
No full textsponsorship: The work described in this paper has been supported in part by the EuropeanCommission through the IST Programme under Contract IST-2002-507932ECRYPT. The information in this document reflects only the authors views,isprovided as is and no guarantee or warranty is given that the information isfit for any particular purpose. The user thereof uses the information at its solerisk and liability. The first author was also funded in part by the EPSRC. The third author is a Postdoctoral Fellow of the Research Foundation Flanders(FWO), and was supported in part by the Concerted Research Action (GOA)Ambiorics 2005/11 of the Flemish Government and by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy). (EuropeanCommission through the IST Programme|IST-2002-507932ECRYPT, EPSRC, Research Foundation Flanders(FWO), Concerted Research Action (GOA)|2005/11, Flemish Government, IAP Programme BCRYPT of the Belgian State (Belgian Science Policy).|P6/26)status: Publishe
Speed records for NTRU
No full textIn this paper NTRUEncrypt is implemented for the first time on a GPU using the CUDA platform. As is shown, this operation lends itself perfectly for parallelization and performs extremely well compared to similar security levels for ECC and RSA giving speedups of around three to five orders of magnitude. The focus is on achieving a high throughput, in this case performing a large number of encryptions/decryptions in parallel. Using a modern GTX280 GPU a throughput of up to 200 000 encryptions per second can be reached at a security level of 256 bits. This gives a theoretical data throughput of 47.8 MB/s. Comparing this to a symmetric cipher (not a very common comparison), this is only around 20 times slower than a recent AES implementation on a GPU. © 2010 Springer-Verlag.sponsorship: This work was supported in part by the IAP Programme P6/26 BCRYPT of the Belgian State (Belgian Science Policy). Research assistant, sponsored by the Fund for Scientific Research - Flanders (FWO) (IAP Programme of the Belgian State (Belgian Science Policy)|P6/26 BCRYPT, Scientific Research - Flanders (FWO))status: Publishe
- …
