The following pages link to Jörn Müller-Quade (Q604631):
Displaying 50 items.
- Long-term security and universal composability (Q604632) (← links)
- Basic algorithms for rational function fields (Q1284279) (← links)
- Separation of orbits under group actions with an application to quantum systems (Q1567560) (← links)
- Recognizing simple subextensions of purely transcendental field extensions (Q1583884) (← links)
- Gröbner bases applied to finitely generated field extensions (Q1588034) (← links)
- Reusing tamper-proof hardware in UC-secure protocols (Q1749298) (← links)
- Non-malleability vs. CCA-security: the case of commitments (Q1753855) (← links)
- Decomposing a matrix into circulant and diagonal factors (Q1971041) (← links)
- Freeness, linear disjointness, and implicitization -- a classical approach. (Q1975385) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm (Q2457340) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- (Q2741391) (← links)
- Synchronous Universally Composable Computer Networks (Q2802420) (← links)
- Closing the Gap: A Universal Privacy Framework for Outsourced Data (Q2802422) (← links)
- Defining Privacy Based on Distributions of Privacy Breaches (Q2867260) (← links)
- Universally Composable Firewall Architectures Using Trusted Hardware (Q2947101) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
- A CCA2 Secure Variant of the McEliece Cryptosystem (Q2989758) (← links)
- Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token (Q3000538) (← links)
- Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions (Q3000549) (← links)
- Efficient Reductions for Non-signaling Cryptographic Primitives (Q3002108) (← links)
- Unconditionally Secure Homomorphic Pre-distributed Bit Commitment and Secure Two-Party Computations (Q3404401) (← links)
- (Q3421466) (← links)
- From Stateful Hardware to Resettable Hardware Using Symmetric Assumptions (Q3467154) (← links)
- (Q3522416) (← links)
- (Q3522510) (← links)
- (Q3522521) (← links)
- Universally Composable Incoercibility (Q3582767) (← links)
- On the (Im-)Possibility of Extending Coin Toss (Q3593114) (← links)
- Long-Term Security and Universal Composability (Q3596373) (← links)
- On the Necessity of Rewinding in Secure Multiparty Computation (Q3596378) (← links)
- Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security (Q3611769) (← links)
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model (Q3623048) (← links)
- (Q4232490) (← links)
- (Q4394974) (← links)
- (Q4426688) (← links)
- (Q4502646) (← links)
- On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits" (Q4571241) (← links)
- Applied Cryptography and Network Security (Q4680955) (← links)
- Implementing Resettable UC-Functionalities with Untrusted Tamper-Proof Hardware-Tokens (Q4910303) (← links)
- IND-CCA Secure Cryptography Based on a Variant of the LPN Problem (Q4911603) (← links)
- Lossy Codes and a New Variant of the Learning-With-Errors Problem (Q4924401) (← links)
- Initiator-Resilient Universally Composable Key Exchange (Q5030209) (← links)
- Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions (Q5200456) (← links)
- Statistically Secure Linear-Rate Dimension Extension for Oblivious Affine Function Evaluation (Q5200458) (← links)
- General Statistically Secure Computation with Bounded-Resettable Hardware Tokens (Q5261634) (← links)
- Information Security and Privacy (Q5315291) (← links)
- (Q5445491) (← links)
