default search action
7. AFRICACRYPT 2014: Marrakesh, Morocco
- David Pointcheval, Damien Vergnaud:
Progress in Cryptology - AFRICACRYPT 2014 - 7th International Conference on Cryptology in Africa, Marrakesh, Morocco, May 28-30, 2014. Proceedings. Lecture Notes in Computer Science 8469, Springer 2014, ISBN 978-3-319-06733-9
Secret-Key Cryptanalysis
- Philippe Gaborit, Olivier Ruatta, Julien Schrek, Gilles Zémor:
New Results for Rank-Based Cryptography. 1-12
Public-Key Cryptography
- Julien Devigne, Eleonora Guerrini, Fabien Laguillaumie:
Proxy Re-Encryption Scheme Supporting a Selection of Delegatees. 13-30 - Afonso Arriaga, Qiang Tang, Peter Y. A. Ryan:
Trapdoor Privacy in Asymmetric Searchable Encryption Schemes. 31-50 - Kaoru Kurosawa, Le Trieu Phong:
Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited. 51-68
Hash Functions
- Sourav Das, Willi Meier:
Differential Biases in Reduced-Round Keccak. 69-87 - Sukhendu Kuila, Dhiman Saha, Madhumangal Pal, Dipanwita Roy Chowdhury:
Practical Distinguishers against 6-Round Keccak-f Exploiting Self-Symmetry. 88-108 - Riham AlTawy, Amr M. Youssef:
Preimage Attacks on Reduced-Round Stribog. 109-125
Secret-Key Cryptanalysis
- Paul Bottinelli, Reza Reyhanitabar, Serge Vaudenay:
Breaking the IOC Authenticated Encryption Mode. 126-135 - Lin Ding, Chenhui Jin, Jie Guan, Chuanda Qi:
New Treatment of the BSW Sampling and Its Applications to Stream Ciphers. 136-146 - Long Wen, Meiqin Wang, Andrey Bogdanov:
Multidimensional Zero-Correlation Linear Cryptanalysis of E2. 147-164
Public-Key Cryptanalysis and Number Theory
- Liqiang Peng, Lei Hu, Jun Xu, Zhangjie Huang, Yonghong Xie:
Further Improvement of Factoring RSA Moduli with Implicit Hint. 165-177 - Abderrahmane Nitaj, Muhammad Rezal Kamel Ariffin, Dieaa I. Nassr, Hatem M. Bahig:
New Attacks on the RSA Cryptosystem. 178-198 - Christophe Tran:
Formulae for Computation of Tate Pairing on Hyperelliptic Curve Using Hyperelliptic Nets. 199-214
Hardware Implementation
- Zhe Liu, Johann Großschädl:
New Speed Records for Montgomery Modular Multiplication on 8-Bit AVR Microcontrollers. 215-234 - Sebastian Kutzner, Phuong Ha Nguyen, Axel Poschmann, Marc Stöttinger:
Minimizing S-Boxes in Hardware by Utilizing Linear Transformations. 235-250 - Vincent Grosso, Emmanuel Prouff, François-Xavier Standaert:
Efficient Masked S-Boxes Processing - A Step Forward -. 251-266 - Begül Bilgin, Benedikt Gierlichs, Svetla Nikova, Ventzislav Nikov, Vincent Rijmen:
A More Efficient AES Threshold Implementation. 267-284
Protocols
- Kazuma Ohara, Kazuo Ohta, Koutarou Suzuki, Kazuki Yoneyama:
Constant Rounds Almost Linear Complexity Multi-party Computation for Prefix Sum. 285-299 - Stefan Dziembowski, Maciej Zdanowicz:
Position-Based Cryptography from Noisy Channels. 300-317
Lattice-Based Cryptography
- Tancrède Lepoint, Michael Naehrig:
A Comparison of the Homomorphic Encryption Schemes FV and YASHE. 318-335 - Rachid El Bansarkhani, Johannes Buchmann:
Towards Lattice Based Aggregate Signatures. 336-355
Public-Key Cryptography
- Özgür Dagdelen, Daniele Venturi:
A Second Look at Fischlin's Transformation. 356-376 - Michael Clear, Hitesh Tewari, Ciaran McGoldrick:
Anonymous IBE from Quadratic Residuosity with Improved Performance. 377-397 - Y. Sreenivasa Rao, Ratna Dutta:
Expressive Attribute Based Signcryption with Constant-Size Ciphertext. 398-419
Secret-Key Cryptography
- Suvadeep Hajra, Chester Rebeiro, Shivam Bhasin, Gaurav Bajaj, Sahil Sharma, Sylvain Guilley, Debdeep Mukhopadhyay:
DRECON: DPA Resistant Encryption by Construction. 420-439 - Farzaneh Abed, Christian Forler, Eik List, Stefan Lucks, Jakob Wenzel:
Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions. 440-458 - Basel Alomair:
Universal Hash-Function Families: From Hashing to Authentication. 459-474
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.