Maria Dubovitskaya
Maria Dubovitskaya
DFINITY Research
Geverifieerd e-mailadres voor dfinity.org
Titel
Geciteerd door
Geciteerd door
Jaar
Oblivious transfer with access control
J Camenisch, M Dubovitskaya, G Neven
Proceedings of the 16th ACM conference on Computer and communications …, 2009
205*2009
Oblivious transfer with hidden access control policies
J Camenisch, M Dubovitskaya, G Neven, GM Zaverucha
International Workshop on Public Key Cryptography, 192-209, 2011
522011
Unlinkable priced oblivious transfer with rechargeable wallets
J Camenisch, M Dubovitskaya, G Neven
International Conference on Financial Cryptography and Data Security, 66-81, 2010
522010
Composable and modular anonymous credentials: Definitions and practical constructions
J Camenisch, M Dubovitskaya, K Haralambiev, M Kohlweiss
International Conference on the Theory and Application of Cryptology and …, 2015
462015
Concepts and languages for privacy-preserving attribute-based authentication
J Camenisch, M Dubovitskaya, A Lehmann, G Neven, C Paquin, ...
IFIP Working Conference on Policies and Research in Identity Management, 34-52, 2013
452013
Oblivious transfer with hidden access control from attribute-based encryption
J Camenisch, M Dubovitskaya, RR Enderlein, G Neven
International Conference on Security and Cryptography for Networks, 559-579, 2012
392012
Accumulators with applications to anonymity-preserving revocation
F Baldimtsi, J Camenisch, M Dubovitskaya, A Lysyanskaya, L Reyzin, ...
2017 IEEE European Symposium on Security and Privacy (EuroS&P), 301-315, 2017
272017
Efficient structure-preserving signature scheme from standard assumptions
J Camenisch, M Dubovitskaya, K Haralambiev
International Conference on Security and Cryptography for Networks, 76-94, 2012
262012
Practical UC-secure delegatable credentials with attributes and their application to blockchain
J Camenisch, M Drijvers, M Dubovitskaya
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
232017
Concepts and languages for privacy-preserving attribute-based authentication
J Camenisch, M Dubovitskaya, RR Enderlein, A Lehmann, G Neven, ...
Journal of information security and applications 19 (1), 25-44, 2014
222014
D2. 2 Architecture for attribute-based credential technologies-final version
P Bichsel, J Camenisch, M Dubovitskaya, R Enderlein, S Krenn, I Krontiris, ...
ABC4TRUST project deliverable. Available online at https://abc4trust. eu …, 2014
152014
Universally composable adaptive oblivious transfer (with access control) from standard assumptions
M Abe, J Camenisch, M Dubovitskaya, R Nishimaki
Proceedings of the 2013 ACM workshop on Digital identity management, 1-12, 2013
142013
Oblivious transfer with hidden access control lists
JL Cameniisch, M Dubovitskaya, G Neven, G Zaverucha
US Patent 8,577,029, 2013
122013
On Efficient Non-Interactive Oblivious Transfer with Tamper-Proof Hardware.
M Dubovitskaya, A Scafuro, I Visconti
IACR Cryptology ePrint Archive 2010, 509, 2010
102010
UC commitments for modular protocol design and applications to revocation and attribute tokens
J Camenisch, M Dubovitskaya, A Rial
Annual International Cryptology Conference, 208-239, 2016
82016
Janus Dam Nielsen, Christian Paquin, Franz-Stefan Preiss, Kai Rannenberg, Ahmad Sabouri, and Michael Stausholm. Architecture for Attribute-based Credential Technologies-Final …
P Bichsel, J Camenisch, M Dubovitskaya, RR Enderlein, S Krenn, ...
82015
On the impossibility of structure-preserving deterministic primitives
M Abe, J Camenisch, R Dowsley, M Dubovitskaya
Theory of Cryptography Conference, 713-738, 2014
82014
Flexible revocation of credentials
JL Camenisch, M Dubovitskaya, AR Duran
US Patent 9,906,512, 2018
72018
An architecture for privacy-abcs
P Bichsel, J Camenisch, M Dubovitskaya, RR Enderlein, S Krenn, ...
Attribute-based Credentials for Trust, 11-78, 2015
72015
H2. 2–ABC4Trust architecture for developers
P Bichsel, J Camenisch, M Dubovitskaya, RR Enderlein, I Krontiris, ...
ABC4Trust heartbeat H 2, 2, 2013
72013
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20