| Publication | Date of Publication | Type |
|---|
| Exponential correlated randomness is necessary in communication-optimal perfectly secure two-party computation | 2024-11-22 | Paper |
| Efficient and generic methods to achieve active security in private information retrieval and more advanced database search | 2024-11-13 | Paper |
| A simple and elementary proof of Zorn's lemma | 2024-11-05 | Paper |
| Explicit lower bounds for communication complexity of PSM for concrete functions | 2024-10-23 | Paper |
| Multi-server PIR with full error detection and limited error correction | 2024-06-25 | Paper |
| Threshold fully homomorphic encryption over the torus | 2024-06-05 | Paper |
| Uniform cyclic group factorizations of finite groups | 2024-04-18 | Paper |
| Private simultaneous messages based on quadratic residues | 2023-11-20 | Paper |
| Explicit and nearly tight lower bound for 2-party perfectly secure FSS | 2023-11-10 | Paper |
| On the optimal communication complexity of error-correcting multi-server PIR | 2023-08-14 | Paper |
| Chosen ciphertext secure keyed two-level homomorphic encryption | 2023-07-26 | Paper |
| A Simple and Elementary Proof of Zorn's Lemma | 2023-05-17 | Paper |
| Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials | 2023-05-12 | Paper |
| Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures | 2023-04-28 | Paper |
| Short lattice signatures in the standard model with efficient tag generation | 2023-03-21 | Paper |
| On Extension of Evaluation Algorithms in Keyed-Homomorphic Encryption | 2023-01-18 | Paper |
| Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols | 2023-01-18 | Paper |
| A Note on Centralizers of Involutions in Coxeter Groups | 2022-12-30 | Paper |
| An improvement of a key exchange protocol relying on polynomial maps | 2022-10-20 | Paper |
| An elementary linear-algebraic proof without computer-aided arguments for the group law on elliptic curves | 2022-10-20 | Paper |
| Constant-round client-aided secure comparison protocol | 2022-08-25 | Paper |
| Efficient Fully Anonymous Public-Key Trace and Revoke with Adaptive IND-CCA Security | 2022-08-11 | Paper |
| On Compression Functions over Small Groups with Applications to Cryptography | 2022-08-04 | Paper |
| Efficient noise generation to achieve differential privacy with applications to secure multiparty computation | 2022-06-17 | Paper |
| Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions | 2022-04-22 | Paper |
| Improved supersingularity testing of elliptic curves using Legendre form | 2022-03-24 | Paper |
| Cryptographic pseudorandom generators can make cryptosystems problematic | 2021-12-21 | Paper |
| Towards Constructing Fully Homomorphic Encryption without Ciphertext Noise from Group Theory | 2021-02-25 | Paper |
| Efficiency and accuracy improvements of secure floating-point addition over secret sharing | 2021-02-23 | Paper |
| An efficient secure division protocol using approximate multi-bit product and new constant-round building blocks | 2021-02-23 | Paper |
| Communication-efficient (client-aided) secure two-party protocols and its application | 2021-02-08 | Paper |
| A single shuffle is enough for secure card-based computation of any Boolean circuit | 2020-12-29 | Paper |
| Locally finite continuations and Coxeter groups of infinite ranks | 2020-08-28 | Paper |
| Polynomial expressions of \(p\)-ary auction functions | 2019-07-08 | Paper |
| An efficient private evaluation of a decision graph | 2019-03-29 | Paper |
| On limitations and alternatives of privacy-preserving cryptographic protocols for genomic data | 2018-10-24 | Paper |
| Secure multi-party computation using polarizing cards | 2018-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176551 | 2018-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3176610 | 2018-07-23 | Paper |
| Chosen ciphertext secure keyed-homomorphic public-key cryptosystems | 2018-07-03 | Paper |
| A public-key encryption scheme based on non-linear indeterminate equations | 2018-04-26 | Paper |
| Intrinsic reflections and strongly rigid Coxeter groups | 2018-04-10 | Paper |
| Secure grouping protocol using a deck of cards | 2018-03-16 | Paper |
| On the Security of Pseudorandomized Information-Theoretically Secure Schemes | 2017-06-08 | Paper |
| Size-Hiding Computation for Multiple Parties | 2017-01-06 | Paper |
| Intrinsic reflections in Coxeter systems | 2016-08-18 | Paper |
| On the Isomorphism Problem for Coxeter Groups and Related Topics | 2016-05-19 | Paper |
| A Simple and Improved Algorithm for Integer Factorization with Implicit Hints | 2016-03-02 | Paper |
| Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards | 2016-01-27 | Paper |
| (Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces | 2015-09-30 | Paper |
| How to Use Pseudorandom Generators in Unconditional Security Settings | 2015-09-29 | Paper |
| A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators | 2015-07-06 | Paper |
| Polynomial Expressions of Carries in p-ary Arithmetics | 2015-06-08 | Paper |
| Optimal observables for minimum-error state discrimination in general probabilistic theories | 2015-04-15 | Paper |
| On affine maps on non-compact convex sets and some characterizations of finite-dimensional solid ellipsoids | 2014-12-04 | Paper |
| Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues | 2014-10-14 | Paper |
| On finite factors of centralizers of parabolic subgroups in Coxeter groups. | 2013-02-21 | Paper |
| Locally parabolic subgroups in Coxeter groups of arbitrary ranks. | 2012-05-23 | Paper |
| On centralizers of parabolic subgroups in Coxeter groups. | 2012-05-07 | Paper |
| A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators | 2011-11-10 | Paper |
| Distinguishability measures and entropies for general probabilistic theories | 2011-06-03 | Paper |
| Physical Equivalence of Pure States and Derivation of Qubit in General Probabilistic Theories | 2010-12-24 | Paper |
| On the Security of Pseudorandomized Information-Theoretically Secure Schemes | 2010-09-29 | Paper |
| An Improvement of Pseudorandomization against Unbounded Attack Algorithms – The Case of Fingerprint Codes | 2010-09-29 | Paper |
| A General Conversion Method of Fingerprint Codes to (More) Robust Fingerprint Codes against Bit Erasure | 2010-09-29 | Paper |
| Pattern Occurrence in the Dyadic Expansion of Square Root of Two and an Analysis of Pseudorandom Number Generators | 2010-05-19 | Paper |
| A characterization of signed graphs with generalized perfect elimination orderings | 2010-04-27 | Paper |
| An improvement of discrete Tardos fingerprinting codes | 2009-10-14 | Paper |
| Signed-eliminable graphs and free multiplicities on the braid arrangement | 2009-07-31 | Paper |
| An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths | 2008-04-17 | Paper |
| Almost central involutions in split extensions of Coxeter groups by graph automorphisms | 2007-04-02 | Paper |
| On the Direct Indecomposability of Infinite Irreducible Coxeter Groups and the Isomorphism Problem of Coxeter Groups | 2006-09-25 | Paper |
| A characterization of finitely generated reflection subgroups of Coxeter groups orthogonal to a reflection | 2006-03-28 | Paper |
| Centralizers of reflections and reflection-independence of Coxeter groups | 2006-02-08 | Paper |
| Computing Richelot isogeny graph of superspecial abelian threefolds | N/A | Paper |
