![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
13. CANS 2014: Heraklion, Crete, Greece
- Dimitris Gritzalis, Aggelos Kiayias, Ioannis G. Askoxylakis:
Cryptology and Network Security - 13th International Conference, CANS 2014, Heraklion, Crete, Greece, October 22-24, 2014. Proceedings. Lecture Notes in Computer Science 8813, Springer 2014, ISBN 978-3-319-12279-3 - Michael Clear, Ciaran McGoldrick
:
Bootstrappable Identity-Based Fully Homomorphic Encryption. 1-19 - Hui Guo, Zhenfeng Zhang, Jiang Zhang
:
Proxy Re-encryption with Unforgeable Re-encryption Keys. 20-33 - Haiyang Xue
, Bao Li, Xianhui Lu, Kunpeng Wang, Yamin Liu:
On the Lossiness of 2 k -th Power and the Instantiability of Rabin-OAEP. 34-49 - Bart Mennink, Bart Preneel:
Breaking and Fixing Cryptophia's Short Combiner. 50-63 - Yosuke Todo, Kazumaro Aoki:
FFT Key Recovery for Integral Attack. 64-81 - Yu Sasaki, Lei Wang:
Message Extension Attack against Authenticated Encryptions: Application to PANDA. 82-97 - Tuomas Kortelainen, Juha Kortelainen:
New Second Preimage Attack Variants against the MD-Structure. 98-110 - Amir Herzberg, Haya Schulmann:
Negotiating DNSSEC Algorithms over Legacy Proxies. 111-126 - Matthias Wachs, Martin Schanzenbach, Christian Grothoff:
A Censorship-Resistant, Privacy-Enhancing and Fully Decentralized Name System. 127-142 - Bernardo David, Rafael Dowsley
, Anderson C. A. Nascimento
:
Universally Composable Oblivious Transfer Based on a Variant of LPN. 143-158 - Koutarou Suzuki, Kazuki Yoneyama:
Converting PKI-Based Authenticated Key Exchange to Identity-Based. 159-174 - Florian Böhl, Simon Greiner, Patrik Scheidecker:
Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender. 175-190 - Akanksha Sharma, Subrat Kumar Dash:
Mining API Calls and Permissions for Android Malware Detection. 191-205 - Nicolas Desmoulins, Roch Lescuyer, Olivier Sanders, Jacques Traoré:
Direct Anonymous Attestations with Dependent Basename Opening. 206-221 - Daniel Augot, Françoise Levy-dit-Vehel, Abdullatif Shikfa:
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers. 222-239 - Sourya Joyee De, Sushmita Ruj
, Asim K. Pal:
Should Silence be Heard? Fair Rational Secret Sharing with Silent and Non-silent Players. 240-255 - Ali El Kaafarani, Liqun Chen
, Essam Ghadafi
, James H. Davenport
:
Attribute-Based Signatures with User-Controlled Linkability. 256-269 - Antonio de la Piedra, Jaap-Henk Hoepman, Pim Vullers:
Towards a Full-Featured Implementation of Attribute Based Credentials on Smart Cards. 270-289 - Aysajan Abidin
, Kanta Matsuura
, Aikaterini Mitrokotsa:
Security of a Privacy-Preserving Biometric Authentication Protocol Revisited. 290-304 - Iraklis Leontiadis, Kaoutar Elkhiyaoui, Refik Molva:
Private and Dynamic Time-Series Data Aggregation with Trust Relaxation. 305-320 - Felix Günther, Mark Manulis, Andreas Peter:
Privacy-Enhanced Participatory Sensing with Collusion Resistance and Data Aggregation. 321-336 - Jun Furukawa:
Short Comparable Encryption. 337-352 - Florian Kelbert, Alexander Pretschner:
Decentralized Distributed Data Usage Control. 353-369 - Christoph Bader:
Efficient Signatures with Tight Real World Security in the Random-Oracle Model. 370-383 - Georgios Fotiadis, Elisavet Konstantinou:
More Sparse Families of Pairing-Friendly Elliptic Curves. 384-399
![](https://dblp.org/img/cog.dark.24x24.png)
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.