-
1
-
2
256 bit standardized crypto for 650 GE – GOST revisited
Published 2012Get full text
Get full text
Journal Article -
3
-
4
Side-channel resistant crypto for less than 2,300 GE
Published 2012Get full text
Get full text
Journal Article -
5
FOAM : searching for hardware-optimal SPN structures and components with a fair comparison
Published 2015Get full text
Get full text
Journal Article -
6
-
7
New results on modular inversion hidden number problem and inversive congruential generator
Published 2020Get full text
Conference Paper -
8
Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Published 2020Get full text
Conference Paper -
9
Zero-knowledge elementary databases with more expressive queries
Published 2020Get full text
Conference Paper -
10
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model
Published 2016Get full text
Get full text
Journal Article -
11
-
12
Towards closing the security gap of Tweak-aNd-Tweak (TNT)
Published 2021Get full text
Conference Paper -
13
PAKEs : new framework, new techniques and more efficient lattice-based constructions in the standard model
Published 2021Get full text
Conference Paper -
14
Practical collision attacks against round-reduced SHA-3
Published 2019Get full text
Get full text
Journal Article -
15
Automatic search of Meet-in-the-Middle preimage attacks on AES-like hashing
Published 2022Get full text
Conference Paper -
16
Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
Published 2021“…© International Association for Cryptologic Research 2015. We present the first two-round, two-party general function evaluation protocol that is secure against honest-but-curious adaptive corruption of both parties. …”
Get full text
Book -
17
On Basing Private Information Retrieval on NP-Hardness
Published 2021“…© International Association for Cryptologic Research 2016. The possibility of basing the security of cryptographic objects on the (minimal) assumption that NP BPP is at the very heart of complexity-theoretic cryptography. …”
Get full text
Article -
18
On Basing Private Information Retrieval on NP-Hardness
Published 2021“…© International Association for Cryptologic Research 2016. The possibility of basing the security of cryptographic objects on the (minimal) assumption that NP BPP is at the very heart of complexity-theoretic cryptography. …”
Get full text
Article -
19
-
20
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
Published 2021“…. © 2014 International Association for Cryptologic Research.…”
Get full text
Article