搜索结果: 1-15 共查到“Sound”相关记录208条 . 查询时间(0.218 秒)
Who, What, Why: Sarah Kane finds ways to represent data as sound(图)
Astronomy 银河系 天体物理学 天文观测
2023/6/29
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Bayesian Approach to Determining the Orientation of Sound-soft Obstacles with Phaseless Data via Wasserstein Distance
Wasserstein距离 贝叶斯方法 无相数据 软声障碍物
2023/4/27
The sound of a sunset(图)
夕阳 超声工具包 声音
2023/6/20
近日,浙江大学传媒与国际文化学院王婧老师的专著《Half Sound,Half Philosophy:Aesthetics,Politics,and History of China's Sound Art》由Bloomsbury Academic出版社出版。
Physicists count sound particles with quantum microphone(图)
Physicists count particles quantum microphone
2020/8/14
Physicists have developed a "quantum microphone" so sensitive it can measure individual particles of sound, called phonons.The device, developed through U.S. National Science Foundation-funded re...
Efficient Tightly-Secure Structure-Preserving Signatures and Unbounded Simulation-Sound QA-NIZK Proofs
Structure-preserving signatures QA-NIZK simulation-soundness
2019/9/16
We show how to construct structure-preserving signatures (SPS) and unbounded quasi-adaptive non-interactive zero-knowledge (USS QA-NIZK) proofs with a tight security reduction to simple assumptions, b...
Simulation-Sound Proofs for LWE and Applications to KDM-CCA2 Security
LWE standard model Naor-Yung
2019/8/8
The Naor-Yung paradigm is a well-known technique that constructs IND-CCA2-secure encryption schemes by means of non-interactive zero-knowledge proofs satisfying a notion of simulation-soundness. Until...
A Round-Collapse Theorem for Computationally-Sound Protocols; or, TFNP is Hard (on Average) in Pessiland
TFNP round-collapse average-case hardness
2019/6/26
This result follows from a more general theory of interactive average-case complexity, and in particular, a novel round-collapse theorem for computationally-sound protocols, analogous to Babai-Moran's...
Efficient Perfectly Sound One-message Zero-Knowledge Proofs via Oracle-aided Simulation
zero-knowledge NIZK RSA ZAP
2019/6/26
In this paper we put forth new one-message proof systems for several practical applications, like proving that an El Gamal ciphertext (over a multiplicative group) decrypts to a given value and correc...
Highly Efficient Key Exchange Protocols with Optimal Tightness -- Enabling real-world deployments with theoretically sound parameters
AKE provable security tightness
2019/6/24
In this paper we give nearly-tight reductions for modern implicitly authenticated Diffie-Hellman protocols in the style of the Signal and Noise protocols which are extremely simple and efficient. Unli...
Simple Yet Efficient Knowledge-Sound and Non-Black-Box Any-Simulation-Extractable ZK-SNARKs
NIZK QAP QSP
2019/6/4
Motivated by applications like verifiable computation and privacy-preserving cryptocurrencies, many efficient pairing-based SNARKs were recently proposed. However, the most efficient SNARKs like the o...
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
non-uniform certificates concurrent zero-knowledge
2019/6/4
We introduce the notion of non-uniformly sound certificates: succinct single-message (unidirectional) argument systems that satisfy a ``best-possible security'' against non-uniform polynomial-time att...
Understanding how the brain makes sense of sound(图)
Understanding how brain makes sense sound
2019/11/22
For neuroscientists, human hearing is a process full of unanswered questions. How does the brain translate sounds -- vibrations that travel through the air -- into the patterns of neural activity that...
Improved (Almost) Tightly-Secure Simulation-Sound QA-NIZK with Applications
QA-NIZK simulation-soundness tight security
2018/11/15
We construct the first (almost) tightly-secure unbounded-simulation-sound quasi-adaptive non-interactive zero-knowledge arguments (USS-QA-NIZK) for linear-subspace languages with compact (number of gr...