Name
Affiliation
Papers
ROLF HAENNI
Bern University of Applied Sciences, Department of Engineering and Information Technology, CH-2501 Biel, Switzerland
62
Collaborators
Citations 
PageRank 
39
371
33.39
Referers 
Referees 
References 
483
631
766
Search Limit
100631
Title
Citations
PageRank
Year
CHVote - Sixteen Best Practices and Lessons Learned.00.342020
Performance of Shuffling - Taking It to the Limits.10.352020
Improving the Performance of Cryptographic Voting Protocols.00.342019
Process Models for Universally Verifiable Elections.00.342018
Outsourcing Modular Exponentiation in Cryptographic Web Applications.00.342018
Modeling a Bulletin Board Service Based on Broadcast Channels with Memory.00.342018
CHVote System Specification.00.342017
Pseudo-Code Algorithms for Verifiable Re-encryption Mix-Nets.10.412017
Cast-as-Intended Verification in Electronic Elections Based on Oblivious Transfer.00.342016
A Generic Interface for the Public Bulletin Board Used in UniVote00.342016
Receipt-free remote electronic elections with everlasting privacy.20.372016
Coercion-Resistant Internet Voting with Everlasting Privacy.60.422016
Efficiency Evaluation of Cryptographic Protocols for Boardroom Voting.00.342015
Verifiable Internet Elections with Everlasting Privacy and Minimal Trust50.512015
A Lightweight Implementation of a Shuffle Proof for Electronic Voting Systems.20.452014
Verifizierbare Internet-Wahlen an Schweizer Hochschulen mit UniVote.10.362013
Attacking the verification code mechanism in the norwegian internet voting system30.402013
A generic approach to prevent board flooding attacks in coercion-resistant electronic voting schemes70.422013
How to Store some Secrets.20.362012
Achieving Meaningful Efficiency in Coercion-Resistant, Verifiable Internet Voting.30.382012
Preventing Board Flooding Attacks in Coercion-Resistant Electronic Voting Schemes.100.582011
Efficient vote authorization in coercion-resistant internet voting90.482011
Secure internet voting on limited devices with anonymized DSA public keys80.492011
A new approach towards coercion-resistant remote e-voting in linear time270.802011
Compiling Possibilistic Networks: Alternative Approaches to Possibilistic Inference130.722010
A novel protocol to allow revocation of votes a hybrid voting system20.372010
Coercion-Resistant Hybrid Voting Systems40.412010
Why Public Registration Boards are Required in E-Voting Systems Based on Threshold Blind Signature Protocols10.352010
Combining Probability and Logic10.372009
Probabilistic argumentation30.412009
A Trust Evaluation Method Based on Logic and Probability Theory.20.382008
Logical Compilation of Bayesian Networks with Discrete Variables50.572007
Compiling solution configurations in semiring valuation systems00.342007
A New Model for Public-Key Authentication10.362007
Optimizing inference in Bayesian networks and semiring valuation algebras00.342007
Multi-state Directed Acyclic Graphs60.592007
Modeling partially reliable information sources: A general approach based on Dempster-Shafer theory130.852006
Implementing Credential Networks30.502006
Special Issue of Minds and Machines on Causality, Uncertainty and Ignorance10.422006
Towards a precise semantics for authenticity and trust00.342006
Uncover Dempster'S Rule Where It Is Hidden30.462006
Propositional DAGs: A New Graph-Based Language for Representing Boolean Functions150.752006
Unifying logical and probabilistic reasoning50.522005
Towards A Unifying Theory Of Logical And Probabilistic Reasoning120.802005
Credential Networks: a General Model for Distributed Trust and Authenticity Management80.602005
Using probabilistic argumentation for key validation in public-key cryptography90.512005
Ordered valuation algebras: a generic framework for approximating inference70.612004
Probabilistic Argumentation Systems: A New Perspective On The Dempster-Shafer Theory181.652003
Anytime argumentative and abductive reasoning60.472003
Web of Trust: Applying Probabilistic Argumentation to Public-Key Cryptography20.382003
  • 1
  • 2