Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
Publication with shared reference
10.1007/978-3-540-24632-9_23
Home
Publications
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
Publication with shared reference
10.1007/978-3-540-24632-9_23
Publications with shared reference:
Efficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
0
publications found
Export
Export
Analytics view
Analytics view
Scroll to top