Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System

Nasima BEGUM; Toru NAKANISHI; Nobuo FUNABIKI

doi:10.1587/transfun.e96.a.2422

Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e96.a.2422 ◽

2013 ◽

Vol E96.A (12) ◽

pp. 2422-2433 ◽

Cited By ~ 3

Author(s):

Nasima BEGUM ◽

Toru NAKANISHI ◽

Nobuo FUNABIKI

Keyword(s):

Anonymous Credential ◽

Cnf Formulas

An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.2020tap0003 ◽

2020 ◽

Vol E103.A (12) ◽

pp. 1381-1392

Author(s):

Ryo OKISHIMA ◽

Toru NAKANISHI

Keyword(s):

Constant Size ◽

Anonymous Credential ◽

Cnf Formulas

Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs

2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE) ◽

10.1109/gcce.2013.6664912 ◽

2013 ◽

Cited By ~ 1

Author(s):

Nasima Begum ◽

Toru Nakanishi ◽

Nobuo Funabiki

Keyword(s):

Public Key ◽

Constant Size ◽

Anonymous Credential ◽

Cnf Formulas

Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System

Lecture Notes in Computer Science - Information Security and Cryptology – ICISC 2012 ◽

10.1007/978-3-642-37682-5_35 ◽

2013 ◽

pp. 495-509 ◽

Cited By ~ 13

Author(s):

Nasima Begum ◽

Toru Nakanishi ◽

Nobuo Funabiki

Keyword(s):

Anonymous Credential ◽

Cnf Formulas

An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations

Advances in Information and Computer Security - Lecture Notes in Computer Science ◽

10.1007/978-3-030-26834-3_6 ◽

2019 ◽

pp. 89-106 ◽

Cited By ~ 2

Author(s):

Ryo Okishima ◽

Toru Nakanishi

Keyword(s):

Constant Size ◽

Anonymous Credential ◽

Cnf Formulas

An efficiency improvement in an anonymous credential system for CNF formulas on attributes with constant-size proofs

2015 International Conference on Electrical Engineering and Information Communication Technology (ICEEICT) ◽

10.1109/iceeict.2015.7307538 ◽

2015 ◽

Author(s):

Nasima Begum ◽

Toru Nakanishi ◽

Yasuyuki Nogami

Keyword(s):

Efficiency Improvement ◽

Constant Size ◽

Anonymous Credential ◽

Cnf Formulas

Research on Anonymous credential based medical blockchain

Journal of Physics Conference Series ◽

10.1088/1742-6596/1802/3/032010 ◽

2021 ◽

Vol 1802 (3) ◽

pp. 032010

Author(s):

Pan Xu ◽

Shaofei Wu

Keyword(s):

Anonymous Credential

On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

ACM Transactions on Computational Logic ◽

10.1145/3091528 ◽

2017 ◽

Vol 18 (3) ◽

pp. 1-46

Author(s):

Ronald De Haan ◽

Iyad Kanj ◽

Stefan Szeider

Keyword(s):

Parameterized Complexity ◽

Cnf Formulas

Generalizations of matched CNF formulas

Annals of Mathematics and Artificial Intelligence ◽

10.1007/s10472-005-0432-6 ◽

2004 ◽

Vol 43 (1-4) ◽

pp. 223-238 ◽

Cited By ~ 8

Author(s):

Stefan Szeider

Keyword(s):

Cnf Formulas

ASIG: An all-solution SAT solver for CNF formulas

2009 11th IEEE International Conference on Computer-Aided Design and Computer Graphics ◽

10.1109/cadcg.2009.5246850 ◽

2009 ◽

Cited By ~ 5

Author(s):

Weinan Zhao ◽

Weimin Wu

Keyword(s):

Sat Solver ◽

Cnf Formulas

An Efficient and Usable Multi-show Non-transferable Anonymous Credential System

Financial Cryptography - Lecture Notes in Computer Science ◽

10.1007/978-3-540-27809-2_21 ◽

2004 ◽

pp. 196-211 ◽

Cited By ~ 24

Author(s):

Giuseppe Persiano ◽

Ivan Visconti

Keyword(s):

Anonymous Credential