UB Paderborn / Katalog / Suche / in CDI

Universally Composable Security

Journal of the ACM, 2020-10, Vol.67 (5), p.1-94

Canetti, Ran

2020

Volltextzugriff (PDF)

Chosen-Ciphertext Secure Fully Homomorphic Encryption

Public-Key Cryptography – PKC 2017, p.213-240

Volltextzugriff (PDF)

Reusable Fuzzy Extractors for Low-Entropy Distributions

Journal of cryptology, 2021, Vol.34 (1), Article 2

2021

Volltextzugriff (PDF)

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption

Advances in Cryptology – EUROCRYPT 2018, p.91-122

Volltextzugriff (PDF)

Security and composition of multiparty cryptographic protocols

Journal of cryptology, 2000, Vol.13 (1), p.143-202

CANETTI, R

2000

Volltextzugriff (PDF)

The random oracle methodology, revisited

Journal of the ACM, 2004-07, Vol.51 (4), p.557-594

2004

Volltextzugriff (PDF)

Universally composable notions of key exchange and secure channels

Lecture notes in computer science, 2002, p.337-351

2002

Volltextzugriff (PDF)

Obfuscation of Probabilistic Circuits and Applications

Theory of Cryptography, p.468-497

Volltextzugriff (PDF)

The Hunting of the SNARK

Journal of cryptology, 2017-10, Vol.30 (4), p.989-1066

2017

Volltextzugriff (PDF)

A forward-secure public-key encryption scheme

Journal of cryptology, 2007-07, Vol.20 (3), p.265-294

2007

Volltextzugriff (PDF)

Toward a Game Theoretic View of Secure Computation

Journal of cryptology, 2016-10, Vol.29 (4), p.879-926

2016

Volltextzugriff (PDF)

Universally composable symbolic analysis of mutual authentication and key-exchange protocols

Lecture notes in computer science, 2006, p.380-403

2006

Volltextzugriff (PDF)

Practical delegation of computation using multiple servers

Proceedings of the 18th ACM conference on Computer and communications security, 2011, p.445-454

2011

Volltextzugriff (PDF)

A Forward-Secure Public-Key Encryption Scheme

Advances in Cryptology — EUROCRYPT 2003, 2003, p.255-271

2003

Volltextzugriff (PDF)

On Strong Simulation and Composable Point Obfuscation

Journal of cryptology, 2014, Vol.27 (2), p.317-357

2014

Volltextzugriff (PDF)

Universally Composable Symbolic Security Analysis

Journal of cryptology, 2011, Vol.24 (1), p.83-147

2011

Volltextzugriff (PDF)

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

SIAM journal on computing, 2018-01, Vol.47 (3), p.1123-1210

2018

Volltextzugriff (PDF)

Towards a Game Theoretic View of Secure Computation

Advances in Cryptology – EUROCRYPT 2011, p.426-445

Volltextzugriff (PDF)

Modular Order-Preserving Encryption, Revisited

Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, 2015, p.763-777

2015

Volltextzugriff (PDF)

Multiparty Computation from Somewhat Homomorphic Encryption

Advances in Cryptology – CRYPTO 2012, p.643-662

Volltextzugriff (PDF)

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

Advances in Cryptology – CRYPTO 2012, p.868-886

Volltextzugriff (PDF)

On the limitations of universally composable two-party computation without set-up assumptions

Journal of cryptology, 2006-04, Vol.19 (2), p.135-167

2006

Volltextzugriff (PDF)

Chosen-ciphertext secure proxy re-encryption

Conference on Computer and Communications Security: Proceedings of the 14th ACM conference on Computer and communications security; 28-31 Oct. 2007, 2007, p.185-194

2007

Volltextzugriff (PDF)

New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques

Advances in Cryptology – CRYPTO 2012, p.180-198

Volltextzugriff (PDF)

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption

Advances in Cryptology – CRYPTO 2012, p.199-217

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Universally Composable Security

Chosen-Ciphertext Secure Fully Homomorphic Encryption

Reusable Fuzzy Extractors for Low-Entropy Distributions

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption

Security and composition of multiparty cryptographic protocols

The random oracle methodology, revisited

Universally composable notions of key exchange and secure channels

Obfuscation of Probabilistic Circuits and Applications

The Hunting of the SNARK

A forward-secure public-key encryption scheme

Toward a Game Theoretic View of Secure Computation

Universally composable symbolic analysis of mutual authentication and key-exchange protocols

Practical delegation of computation using multiple servers

A Forward-Secure Public-Key Encryption Scheme

On Strong Simulation and Composable Point Obfuscation

Universally Composable Symbolic Security Analysis

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

Towards a Game Theoretic View of Secure Computation

Modular Order-Preserving Encryption, Revisited

Multiparty Computation from Somewhat Homomorphic Encryption

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

On the limitations of universally composable two-party computation without set-up assumptions

Chosen-ciphertext secure proxy re-encryption

New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption

Suchergebnisse filtern