| Efficient Secure Ridge Regression from Randomized Gaussian Elimination. | 0 | 0.34 | 2021 |
| Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks. | 0 | 0.34 | 2019 |
| Secure simultaneous bit extraction from Koblitz curves. | 1 | 0.37 | 2019 |
| Certificate Validation in Secure Computation and Its Use in Verifiable Linear Programming. | 3 | 0.40 | 2016 |
| Attacks and parameter choices in HIMMO. | 0 | 0.34 | 2016 |
| Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems. | 5 | 0.41 | 2015 |
| Guaranteeing Correctness in Privacy-Friendly Outsourcing by Certificate Validation. | 0 | 0.34 | 2015 |
| Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation | 3 | 0.39 | 2015 |
| Practical Secure Decision Tree Learning in a Teletreatment Application. | 4 | 0.40 | 2014 |
| New Security Notions And Relations For Public-Key Encryption | 0 | 0.34 | 2012 |
| Sharp lower bounds on the extractable randomness from non-uniform sources | 4 | 0.53 | 2011 |
| Anonymous Credential Schemes With Encrypted Attributes | 4 | 0.41 | 2010 |
| Modulo reduction for paillier encryptions and application to secure statistical analysis | 15 | 0.76 | 2010 |
| Verifiable Rotation of Homomorphic Encryptions | 6 | 0.46 | 2009 |
| E-Voting and Identity, Second International Conference, VOTE-ID 2009, Luxembourg, September 7-8, 2009. Proceedings | 11 | 0.94 | 2009 |
| An efficient protocol for fair secure two-party computation | 8 | 0.54 | 2008 |
| Revisiting the Karnin, Greene and Hellman Bounds | 0 | 0.34 | 2008 |
| Practical and secure solutions for integer comparison | 49 | 1.80 | 2007 |
| Smooth Renyi Entropy Of Ergodic Quantum Information Sources | 1 | 0.67 | 2007 |
| Efficient committed oblivious transfer of bit strings | 7 | 0.47 | 2007 |
| Efficient pseudorandom generators based on the DDH assumption | 0 | 0.34 | 2006 |
| List signature schemes | 11 | 0.58 | 2006 |
| Cryptanalysis of the Dual Elliptic Curve Pseudorandom Generator. | 9 | 0.71 | 2006 |
| Efficient binary conversion for paillier encrypted values | 62 | 2.71 | 2006 |
| Generic Security Proof Of Quantum Key Exchange Using Squeezed States | 0 | 0.34 | 2005 |
| Quantum Information Theoretical Analysis Of Various Constructions For Quantum Secret Sharing | 2 | 0.60 | 2005 |
| Concrete security of the blum-blum-shub pseudorandom generator | 16 | 0.94 | 2005 |
| On second-order differential power analysis | 64 | 4.43 | 2005 |
| Experiments with queries over encrypted data using secret sharing | 1 | 0.37 | 2005 |
| State Recovery Attacks on Pseudorandom Generators | 4 | 0.58 | 2005 |
| Practical Two-Party Computation Based on the Conditional Gate | 49 | 2.45 | 2004 |
| A fair and efficient solution to the socialist millionaires’ problem | 64 | 6.51 | 2001 |
| Optimally Efficient Accountable Time-Stamping | 27 | 1.72 | 2000 |
| A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic | 97 | 4.20 | 1999 |
| A tight lower bound for top-down skew heaps | 1 | 0.34 | 1997 |
| A Secure and Optimally Efficient Multi-Authority Election Scheme | 385 | 30.18 | 1997 |
| Security Aspects of the Ecash Payment System | 16 | 1.27 | 1997 |
| Multi-Autority Secret-Ballot Elections with Linear Work. | 19 | 0.92 | 1996 |
| Systolic arrays for the recognition of permutation-invariant segments | 0 | 0.34 | 1996 |
| Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols | 538 | 36.87 | 1994 |
| The ESPRIT Project CAFE - High Security Digital Payment Systems | 48 | 9.44 | 1994 |
| A systematic analysis of splaying | 2 | 0.47 | 1993 |
| Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space | 8 | 0.71 | 1992 |
| The derivation of a tighter bound for top-down skew heaps | 4 | 0.53 | 1991 |
| A parallel program for the recognition of P-invariant segments | 0 | 0.34 | 1991 |
| Searching by elimination | 2 | 0.71 | 1989 |
