International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also get this service via

To receive your credentials via mail again, please click here.

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

Filter (AND): ACBookCHESConfCryptoECElectionEventFSEForumJoCJobNewNewsPKCPhDPubReviewServiceSoftwareTCCUpdateePrint

1 2 3 4 5 6 7 8 9 10 11 12 [ 13 ]
2013-10-28
21:17 [Pub][ePrint]More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input, by Nir Bitansky and Ran Canetti and Omer Paneth and Alon Rosen[ expand ]
21:17 [Pub][ePrint]Higher Order Masking of Look-up Tables, by Jean-Sebastien Coron[ expand ]
21:17 [Pub][ePrint]Bootstrapping Obfuscators via Fast Pseudorandom Functions, by Benny Applebaum[ expand ]
21:17 [Pub][ePrint]Cryptanalysis and improvement of a dynamic and secure key management model for hierarchical heterogeneous sensor networks, by Xi-Jun Lin and Lin Sun[ expand ]
21:17 [Pub][ePrint]A More Efficient AES Threshold Implementation, by Begul Bilgin and Benedikt Gierlichs and Svetla Nikova and Ventzislav Nikov and Vincent Rijmen[ expand ]
21:17 [Pub][ePrint]Examination of a New Defense Mechanism: Honeywords, by Ziya Genc, Süleyman Kardas, and Mehmet Sabir Kiraz[ expand ]
21:17 [Pub][ePrint]AEGIS: A Fast Authenticated Encryption Algorithm, by Hongjun Wu and Bart Preneel[ expand ]
21:17 [Pub][ePrint]Write-Only Oblivious RAM based Privacy-Preserved Access of Outsourced Data, by Lichun Li and Anwitaman Datta[ expand ]
21:17 [Pub][ePrint]Secure Key Exchange and Sessions Without Credentials, by Ran Canetti and Vladimir Kolesnikov and Charles Rackoff and and Yevgeniy Vahlis[ expand ]
21:17 [Pub][ePrint]Faster Compact Diffie-Hellman: Endomorphisms on the x-line, by Craig Costello and Huseyin Hisil and Benjamin Smith[ expand ]
21:17 [Pub][ePrint]Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures, by Benoit Libert and Thomas Peters and Marc Joye and Moti Yung[ expand ]


2013-10-24
18:17 [Pub][ePrint]Obfuscation ==> (IND-CPA Security =/=> Circular Security), by Antonio Marcedone and Claudio Orlandi[ expand ]
18:17 [Pub][ePrint]Differing-Inputs Obfuscation and Applications, by Prabhanjan Ananth and Dan Boneh and Sanjam Garg and Amit Sahai and Mark Zhandry[ expand ]
18:17 [Pub][ePrint]Unbalancing Pairing-Based Key Exchange Protocols, by Michael Scott[ expand ]
18:17 [Pub][ePrint]How to Compress (Reusable) Garbled Circuits, by Craig Gentry and Sergey Gorbunov and Shai Halevi and Vinod Vaikuntanathan and Dhinakaran Vinayagamurthy[ expand ]
18:17 [Pub][ePrint]New abstractions in applied pi-calculus and automated verification of protected executions, by Shiwei Xu and Sergiu Bursuc and Julian P. Murphy[ expand ]
18:17 [Pub][ePrint]Solving shortest and closest vector problems: The decomposition approach, by Anja Becker, Nicolas Gama and Antoine Joux[ expand ]
18:17 [Pub][ePrint]Fully Bideniable Public-Key Encryption, by Marcel Sebek[ expand ]
12:17 [Pub][ePrint]Separations in Circular Security for Arbitrary Length Key Cycles, by Venkata Koppula and Kim Ramchen and Brent Waters[ expand ]
12:17 [Pub][ePrint]Secret Key Cryptosystem based on Non-Systematic Polar Codes, by Reza Hooshmand[ expand ]
12:17 [Pub][ePrint]Public-Key Encryption with Weak Randomness: Security against Strong Chosen Distribution Attacks, by Damien Vergnaud and David Xiao[ expand ]
12:17 [Pub][ePrint]A Black-Box Construction of a CCA2 Encryption Scheme from a Plaintext Aware Encryption Scheme, by Dana Dachman-Soled[ expand ]
12:17 [Pub][ePrint]Formal verification of a software countermeasure against instruction skip attacks, by Karine Heydemann and Nicolas Moro and Emmanuelle Encrenaz and Bruno Robisson[ expand ]
12:17 [Pub][ePrint]Universally composable privacy preserving finite automata execution with low online and offline complexity, by Peeter Laud and Jan Willemson[ expand ]
12:17 [Pub][ePrint]Bounded Tamper Resilience: How to go beyond the Algebraic Barrier, by Ivan Damgaard and Sebastian Faust and Pratyay Mukherjee and Daniele Venturi[ expand ]
09:17 [Pub][ePrint]Automatic Security Evaluation for Bit-oriented Block Ciphers in Related-key Model: Application to PRESENT-80, LBlock and Others, by Siwei Sun, Lei Hu, Peng Wang[ expand ]
09:17 [Pub][ePrint]A Practical Related-Key Boomerang Attack for the Full MMB Block Cipher, by Tomer Ashur and Orr Dunkelman[ expand ]
09:17 [Pub][ePrint]Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys, by Eli Biham and Yaniv Carmeli and Itai Dinur and Orr Dunkelman and Nathan Keller and Adi Shamir[ expand ]
09:17 [Pub][ePrint]Traps to the BGJT-Algorithm for Discrete Logarithms, by Qi Cheng and Daqing Wan and Jincheng Zhuang[ expand ]
09:17 [Pub][ePrint]Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians, by Benjamin Smith[ expand ]
09:17 [Pub][ePrint]Robust Pseudorandom Generators, by Yuval Ishai and Eyal Kushilevitz and Xin Li and Rafail Ostrovsky and Manoj Prabhakaran and Amit Sahai and David Zuckerman[ expand ]
09:17 [Pub][ePrint]Switching Lemma for Bilinear Tests and Constant-size NIZK Proofs for Linear Subspaces, by Charanjit Jutla and Arnab Roy[ expand ]
09:17 [Pub][ePrint]Attribute-Based Encryption for Arithmetic Circuits, by Dan Boneh and Valeria Nikolaenko and Gil Segev[ expand ]
09:17 [Pub][ePrint]Obfuscation for Evasive Functions, by Boaz Barak and Nir Bitansky and Ran Canetti and Yael Tauman Kalai and Omer Paneth and Amit Sahai[ expand ]
09:17 [Pub][ePrint]A TPM Diffie-Hellman Oracle, by Tolga Acar and Lan Nguyen and Greg Zaverucha[ expand ]
09:17 [Pub][ePrint]An Offline Dictionary Attack against a Three-Party Key Exchange Protocol, by Junghyun Nam and Kim-Kwang Raymond Choo and Juryon Paik and Dongho Won[ expand ]
09:17 [Pub][ePrint]A Note on the Impossibility of Obfuscation with Auxiliary Input, by Shafi Goldwasser and Yael Tauman Kalai[ expand ]
09:17 [Pub][ePrint]TUC: Time-sensitive and Modular Analysis of Anonymous Communication, by Michael Backes and Praveen Manoharan and Esfandiar Mohammadi[ expand ]
09:17 [Pub][ePrint]Linear Cryptanalysis of Round Reduced Variants of SIMON, by Javad Alizadeh, Nasour Bagheri, Praveen Gauravaram, Abhishek Kumar, and Somitra Kumar Sanadhya[ expand ]
09:17 [Pub][ePrint]Fine-Tuning Groth-Sahai Proofs, by Alex Escala and Jens Groth[ expand ]
09:17 [Pub][ePrint]Anonymous aggregation for lightweight multiparty computations, by Constantinos Patsakis[ expand ]
09:17 [Pub][ePrint]Discrete Logarithms and Mordell-Weil Groups , by Mohammad Sadek[ expand ]
04:41 [Event][New]PUFFIN: Physically Unclonable Functions Workshop[ expand ]
04:34 [Job][New]Security Consultant, ESCRYPT Inc., Ann Arbor[ expand ]
04:33 [Job][New]Lecturer, University College London, UK, EU[ expand ]