Jan Camenisch

Citado por

	Total	Desde 2020
Citas	30262	8234
Índice h	79	45
Índice i10	205	145

1800

900

450

1350

1998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025102 161 146 249 317 514 638 907 1017 1020 1076 1273 1574 1373 1454 1394 1556 1438 1340 1195 1368 1474 1682 1644 1694 1740 1381 92

Acceso público

Ver todo

25 artículos

1 artículo

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Gregory NevenChainlink LabsDirección de correo verificada de smartcontract.com
Anna LysyanskayaProfessor of Computer Science, Brown UniversityDirección de correo verificada de cs.brown.edu
Anja LehmannHasso Plattner Institute, University of PotsdamDirección de correo verificada de hpi.de
Thomas GroßProfessor of System Security, Newcastle UniversityDirección de correo verificada de ncl.ac.uk
Maria DubovitskayaDFINITY ResearchDirección de correo verificada de dfinity.org
Manu DrijversDFINITYDirección de correo verificada de dfinity.org
Markulf KohlweissUniveristy of EdinburghDirección de correo verificada de ed.ac.uk
Susan HohenbergerJohns Hopkins UniversityDirección de correo verificada de cs.jhu.edu
Victor ShoupResearch Scientist, Offchain Labs; Professor Emeritus, NYUDirección de correo verificada de shoup.net
Stephan KrennAIT Austrian Institute of Technology GmbHDirección de correo verificada de ait.ac.at
Patrik BichselPrivacy Researcher, IBM Research - Zurich Dirección de correo verificada de zurich.ibm.com
Christian CachinUniversity of Bern, Cryptology and Data Security GroupDirección de correo verificada de inf.unibe.ch
Michael WaidnerTU Darmstadt, ATHENE, Fraunhofer SITDirección de correo verificada de tu-darmstadt.de
Liqun ChenProfessor, University of Surrey, UKDirección de correo verificada de surrey.ac.uk
Kai SamelinDZ HypDirección de correo verificada de dzhyp.de
Robert R. EnderleinGoogleDirección de correo verificada de e7n.ch
abhi shelatProfessor of Computer ScienceDirección de correo verificada de neu.edu
Giuseppe AtenieseGeorge Mason UniversityDirección de correo verificada de gmu.edu
Günter KarjothLucerne University of Applied SciencesDirección de correo verificada de acm.org
Gene TsudikPeter & Lois Griffin Professor, Jolly Good Fellow of This & ThatDirección de correo verificada de ics.uci.edu

Seguir

Jan Camenisch

DFINITY

Dirección de correo verificada de dfinity.org - Página principal

Privacy Cryptography Cryptographic Protocols Identity Management


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
An efficient system for non-transferable anonymous credentials with optional anonymity revocation J Camenisch, A Lysyanskaya Advances in Cryptology—EUROCRYPT 2001: International Conference on the …, 2001	1832	2001
Efficient group signature schemes for large groups J Camenisch, M Stadler Annual international cryptology conference, 410-424, 1997	1688	1997
Direct anonymous attestation E Brickell, J Camenisch, L Chen Proceedings of the 11th ACM conference on Computer and communications …, 2004	1419	2004
A practical and provably secure coalition-resistant group signature scheme G Ateniese, J Camenisch, M Joye, G Tsudik Advances in Cryptology—CRYPTO 2000: 20th Annual International Cryptology …, 2000	1302	2000
Signature schemes and anonymous credentials from bilinear maps J Camenisch, A Lysyanskaya Annual international cryptology conference, 56-72, 2004	1300	2004
Dynamic accumulators and application to efficient revocation of anonymous credentials J Camenisch, A Lysyanskaya Advances in Cryptology—CRYPTO 2002: 22nd Annual International Cryptology …, 2002	1194	2002
A signature scheme with efficient protocols J Camenisch, A Lysyanskaya Security in Communication Networks: Third International Conference, SCN 2002 …, 2003	1074	2003
Design and implementation of the idemix anonymous credential system J Camenisch, E Van Herreweghen Proceedings of the 9th ACM Conference on Computer and Communications …, 2002	877	2002
Practical verifiable encryption and decryption of discrete logarithms J Camenisch, V Shoup Annual International Cryptology Conference, 126-144, 2003	682	2003
Compact e-cash J Camenisch, S Hohenberger, A Lysyanskaya Annual International Conference on the Theory and Applications of …, 2005	629	2005
Blind signatures based on the discrete logarithm problem JL Camenisch, JM Piveteau, MA Stadler Advances in Cryptology—EUROCRYPT'94: Workshop on the Theory and Application …, 1995	505	1995
Fair blind signatures M Stadler, JM Piveteau, J Camenisch Advances in Cryptology—EUROCRYPT’95: International Conference on the Theory …, 1995	462	1995
Efficient and generalized group signatures J Camenisch International conference on the theory and applications of cryptographic …, 1997	452	1997
Proving in zero-knowledge that a number is the product of two safe primes J Camenisch, M Michels Advances in Cryptology—EUROCRYPT’99: International Conference on the Theory …, 1999	435	1999
Using a rules model to improve handling of personally identifiable information SB Adler, EF Bangerter, NHJ Brown, J Camenisch, AM Gilbert, G Karjoth, ... US Patent 7,069,427, 2006	418	2006
Efficient protocols for set membership and range proofs J Camenisch, R Chaabouni, A Shelat International Conference on the Theory and Application of Cryptology and …, 2008	410	2008
Randomizable proofs and delegatable anonymous credentials M Belenkiy, J Camenisch, M Chase, M Kohlweiss, A Lysyanskaya, ... Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009	401	2009
An accumulator based on bilinear maps and efficient revocation for anonymous credentials J Camenisch, M Kohlweiss, C Soriente Public Key Cryptography–PKC 2009: 12th International Conference on Practice …, 2009	391	2009
Digital payment systems with passive anonymity-revoking trustees J Camenisch, U Maurer, M Stadler Journal of Computer Security 5 (1), 69-89, 1997	367	1997
Proof systems for general statements about discrete logarithms J Camenisch, M Stadler Technical Report/ETH Zurich, Department of Computer Science 260, 1997	364	1997

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores