Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Cryptology, Volume 31
Volume 31, Number 1, January 2018
- Benny Applebaum, Yuval Ishai, Eyal Kushilevitz:
Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings. 1-22 - Dario Catalano, Dario Fiore:
Practical Homomorphic Message Authenticators for Arithmetic Circuits. 23-59 - Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. 60-100 - Christina Boura, Virginie Lallemand, María Naya-Plasencia, Valentin Suder:
Making the Impossible Possible. 101-133 - Ilya Mironov
, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. 134-161 - Shoni Gilboa, Shay Gueron, Ben Morris:
How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function? 162-171 - Seung Geol Choi, Dana Dachman-Soled, Tal Malkin, Hoeteck Wee:
A Black-Box Construction of Non-malleable Encryption from Semantically Secure Encryption. 172-201 - Zvika Brakerski, Gil Segev:
Function-Private Functional Encryption in the Private-Key Setting. 202-225 - Eiichiro Fujisaki:
All-But-Many Encryption. 226-275 - Saqib A. Kakvi, Eike Kiltz:
Optimal Security Proofs for Full Domain Hash, Revisited. 276-306
Volume 31, Number 2, April 2018
- Michel Abdalla, Mihir Bellare, Gregory Neven:
Robust Encryption. 307-350 - Nicolas Bruneau, Sylvain Guilley, Zakaria Najm, Yannick Teglia:
Multivariate High-Order Attacks of Shuffled Tables Recomputation. 351-393 - Bin Zhang, Chao Xu, Dengguo Feng:
Practical Cryptanalysis of Bluetooth Encryption with Condition Masking. 394-433 - Zvika Brakerski, Ilan Komargodski, Gil Segev:
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. 434-520 - Ben Morris, Phillip Rogaway, Till Stegers:
Deterministic Encryption with the Thorp Shuffle. 521-536 - Carmit Hazay:
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs. 537-586 - Ran Cohen, Iftach Haitner, Eran Omri, Lior Rotem:
Characterization of Secure Multiparty Computation Without Broadcast. 587-609 - Shi Bai, Tancrède Lepoint, Adeline Roux-Langlois, Amin Sakzad, Damien Stehlé, Ron Steinfeld:
Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance. 610-640
Volume 31, Number 3, July 2018
- Achiya Bar-On, Eli Biham, Orr Dunkelman, Nathan Keller:
Efficient Slide Attacks. 641-670 - Yehuda Lindell, Eran Omri, Hila Zarosim:
Completeness for Symmetric Two-Party Functionalities: Revisited. 671-697 - Gilad Asharov, Gil Segev:
On Constructing One-Way Permutations from Indistinguishability Obfuscation. 698-736 - Yehuda Lindell, Hila Zarosim:
On the Feasibility of Extending Oblivious Transfer. 737-773 - Vadim Lyubashevsky, Daniele Micciancio:
Asymptotically Efficient Lattice-Based Digital Signatures. 774-797 - Shay Gueron, Yehuda Lindell, Ariel Nof, Benny Pinkas:
Fast Garbling of Circuits Under Standard Assumptions. 798-844 - Brice Minaud, Patrick Derbez, Pierre-Alain Fouque, Pierre Karpman:
Key-Recovery Attacks on ASASA. 845-884 - Anne Canteaut, Sergiu Carpov, Caroline Fontaine, Tancrède Lepoint, María Naya-Plasencia, Pascal Paillier, Renaud Sirdey:
Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression. 885-916
Volume 31, Number 4, October 2018
- Michel Abdalla, Fabrice Benhamouda, Alain Passelègue, Kenneth G. Paterson:
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier. 917-964 - Dominique Unruh:
Everlasting Multi-party Computation. 965-1011 - Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. 1012-1063 - Shan Chen, Rodolphe Lampe, Jooyoung Lee, Yannick Seurin, John P. Steinberger:
Minimizing the Two-Round Even-Mansour Cipher. 1064-1119 - Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh:
On the (Im-)Possibility of Extending Coin Toss. 1120-1163 - Michael Hutter, Erich Wenger:
Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors. 1164-1182
a service of 
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.
last updated on 2024-06-21 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
